An Dynamic Lot-Sizing Model with Multi-Mode Shipments

摘要：

In this paper,we consider a two-echelon dynamic lotsizing problem with multiple ship ment modes between the warehouse and the distribution center.We present an optimal polynomial algorithm for this problem. The computational complexity of the algorithm is O (T5),where T is the length of the finite planning horizon.

关键词： Lot-sizing Inventory replenishment Dynamic programming Multiple shipment modes

作者: Yu-Zhong Zhang Ru-Zhen Yan Wei Gao

作者单位: College of Operations Research and Management Science,Qufu Normal University,Rizhao,Shandong,China 2 College of Operations Research and Management Science,Qufu Normal University,Rizhao,Shandong,China College of Business,Sichuan University,Chengdu,Sichuan,China 610065

会议类型: 国际会议

会议名称: The 8th International Symposium on Operations Research and Its Applications(第八届运筹及其应用国际专题讨论会 ISORA09)

会议地点: 张家界

会议语种:英文

页码: 290-297

在线出版日期: 2009-09-20（万方平台首次上网日期，不代表论文的发表时间）