Please use this identifier to cite or link to this item:
|Title:||Dynamic lot-sizing problem with demand time windows and container-based transportation cost|
|Authors:||Jaruphongsa, W. |
|Citation:||Jaruphongsa, W., Lee, C.-Y. (2008-01). Dynamic lot-sizing problem with demand time windows and container-based transportation cost. Optimization Letters 2 (1) : 39-51. ScholarBank@NUS Repository. https://doi.org/10.1007/s11590-006-0042-1|
|Abstract:||In this paper, we study the dynamic lot-sizing problem with demand time windows and container-based transportation cost. For each particular demand, there are corresponding earliest and latest times, and the duration between such earliest and latest times is the demand time window. If a demand is satisfied by a delivery within demand time window, then there is no holding or backlogging cost incurred. Our purpose is to satisfy demand at a minimum total cost, including setup cost, procurement cost, container cost, and inventory holding cost. © 2006 Springer-Verlag.|
|Source Title:||Optimization Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2019
WEB OF SCIENCETM
checked on Feb 6, 2019
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.