Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/s10898-004-6092-y | J. Global Optimization |
Keywords | Field | DocType |
Demand time-window,Dynamic programming,Lot-sizing | Dynamic programming,Mathematical optimization,Vendor-managed inventory,Time complexity,Inventory optimization,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
30 | 4 | 0925-5001 |
Citations | PageRank | References |
7 | 0.68 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wikrom Jaruphongsa | 1 | 101 | 7.88 |
| Sila Çetinkaya | 2 | 144 | 13.01 |
| Chung Yee Lee | 3 | 1701 | 172.81 |