Please use this identifier to cite or link to this item:
|Title:||A two-echelon inventory optimization model with demand time window considerations|
|Authors:||Jaruphongsa, W. |
|Citation:||Jaruphongsa, W., Çetinkaya, S., Lee, C.-Y. (2004-12). A two-echelon inventory optimization model with demand time window considerations. Journal of Global Optimization 30 (4) : 347-366. ScholarBank@NUS Repository. https://doi.org/10.1007/s10898-004-6092-y|
|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. © 2004 Kluwer Academic Publishers.|
|Source Title:||Journal of Global Optimization|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 11, 2018
WEB OF SCIENCETM
checked on Oct 17, 2018
checked on Nov 2, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.