摘要
讨论包括运输成本、购货成本以及库存成本在内的总成本最小的供应链协作供应问题。在带有时间需求的多个供应点协作供应的前提条件下,建立了使总成本最小的多物资需求的数学模型;设计了一个求解该模型的算法,证明了该算法的可行性和最优性,给出了该算法的算法复杂度,从而指出该算法是一个拟多项式时间算法;最后给出了一个算例。
In this paper we discussed the problem of collaboration-supply in supply chain based on minimal total cost including transportation cost, purchase cost and inventory cost. At the precondition of multiple spots to afford the collaborationsupply with time windows, we gave a mathematic model for the purpose to minimize the total cost with multiple materials requirement and a algorithm to .solve it. Compared with others, the algorithm＇ s validity, feasibility, optimality and complexity have been deeply analyzed. At last a example was given.
出处
《系统工程》
CSCD
北大核心
2006年第4期13-16,共4页
Systems Engineering
关键词
时间窗
供应链
协作供应
成本
算法
Time Windows
Supply Chain
Collaboration Supply
Cost
Algorithm
