A Two-Echelon Inventory Optimization Model with Demand Time Window Considerations

被引：0
作者：
Wikrom Jaruphongsa
Sila Çetinkaya
Chung-Yee Lee
机构：
[1] National University of Singapore,Department of Industrial and Systems Engineering
[2] Texas A&M University,Department of Industrial Engineering
[3] College Station,Department of Industrial Engineering and Engineering Management
[4] TX,undefined
[5] The Hong Kong University of Science and Technology,undefined
[6] Clear Water Bay,undefined
来源：
Journal of Global Optimization | 2004年 / 30卷
关键词：
Demand time-window; Dynamic programming; Lot-sizing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper studies a two-echelon dynamic lot-sizing model with demand time windows and early and late delivery penalties. The problem is motivated by third-party logistics and vendor managed inventory applications in the computer industry where delivery time windows are typically specified under a time definite delivery contract. Studying the optimality properties of the problem, the paper provides polynomial time algorithms that require O(T3) computational complexity if backlogging is not allowed and O(T5) computational complexity if backlogging is allowed.
引用
收藏
页码：347 / 366
页数：19
相关论文
共 66 条
[1]  
Aggarwal A.(1993)Improved algorithms for economic lot-size problems Operations Research 41 549-571
[2]  
Park J.K.(1984)Approximation methods for the uncapacitated dynamic lot size problem Management Science 30 1121-1140
[3]  
Bitran G.B.(1982)Computational complexity of the capacitated lot size problem Management Science 28 1174-1185
[4]  
Magnanti T.L.(1982)Improved heuristics for multistage requirements planning systems Management Science 28 44-56
[5]  
Yanasse H.H.(2000)Stock replenishment and shipment scheduling for vendor managed inventory systems Management Science 46 217-232
[6]  
Bitran G.B.(1994)A new dynamic programming algorithm for the single item capacitated dynamic lot size model Journal of Global Optimization 4 285-300
[7]  
Yanasse H.H.(1988)Optimal common due date with limited completion time deviation Computers and Operations Research 15 420-426
[8]  
Blackburn J.D.(1988)An Management Science 34 420-426
[9]  
Millen R.A.(1973)( Management Science 20 14-21
[10]  
Çetinkaya S(1992)) algorithm for the NI/G/NI/ND capacitated lot size problem Operations Research 40 342-254
1234567