摘要
为了从采购费用结构不同的供应商中找到最佳补货策略,考虑一个零售商从两个供应商补货的二供应商经济批量问题.零售商在两个供应商处的采购费用结构分别为复合安装费用和全单位数量折扣费用结构.通过对问题结构性质的分析论证,将问题的可行解转化为一个有向网络,降低问题求解的计算复杂性.综合动态规划和Dijkstra最短路算法证明了该问题是多项式时间可解的.
In order to find the optimal replenishment policy from the suppliers with different structures,this paper considers the two-supplier economic lot-size problem in which the retailer replenishes products from two suppliers.The two suppliers are characterized by multiple set-ups and all-unit quantity discount cost structures.Some structure properties are proposed to reduce the computational complexity.Then the feasible solutions of the problem are converted into a directed network.It is proved that this two-supplier economic lot-size problem can be solved in polynomial time by integrated dynamic programming and Dijkstra＇s shortest-path algorithm.
出处
《系统科学与数学》
CSCD
北大核心
2010年第7期936-946,共11页
Journal of Systems Science and Mathematical Sciences
基金
国家自然科学基金(70971076和10926077)资助课题
关键词
批量
复合安装费用
全单位数量折扣
计算复杂性
动态规划
Lot-size
multiple set-ups cost
all-unit quantity discount
computational complexity
dynamic programming.
