Please use this identifier to cite or link to this item: https://doi.org/10.1007/s10898-004-6092-y
Title: A two-echelon inventory optimization model with demand time window considerations
Authors: Jaruphongsa, W. 
Çetinkaya, S.
Lee, C.-Y.
Keywords: Demand time-window
Dynamic programming
Lot-sizing
Issue Date: Dec-2004
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
URI: http://scholarbank.nus.edu.sg/handle/10635/86997
ISSN: 09255001
DOI: 10.1007/s10898-004-6092-y
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

22
checked on Aug 16, 2018

WEB OF SCIENCETM
Citations

16
checked on Jul 24, 2018

Page view(s)

43
checked on Jul 6, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.