An Dynamic Lot-Sizing Model with Multi-Mode Shipments

被引：0
|
作者：
Zhang, Yu-Zhong [1 ]
Yan, Ru-Zhen [1 ]
Gao, Wei [2 ]
机构：
[1] Qufu Normal Univ, Coll Operat Res & Management Sci, Rizhao 276826, Shandong, Peoples R China
[2] Sichuan Univ, Coll Business, Chengdu 610065, Sichuan, Peoples R China
来源：
OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS | 2009年 / 10卷
关键词：
Lot-sizing; Inventory replenishment; Dynamic programming; Multiple shipment modes; COST STRUCTURES; INVENTORY; DELIVERY; TIME;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider a two-echelon dynamic lot-sizing problem with multiple shipment 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(T-5), where T is the length of the finite planning horizon.
引用
收藏
页码：290 / +
页数：2
相关论文
共 50 条
12345