Please use this identifier to cite or link to this item: https://doi.org/10.1007/s11590-006-0042-1
DC FieldValue
dc.titleDynamic lot-sizing problem with demand time windows and container-based transportation cost
dc.contributor.authorJaruphongsa, W.
dc.contributor.authorLee, C.-Y.
dc.date.accessioned2014-06-17T07:00:14Z
dc.date.available2014-06-17T07:00:14Z
dc.date.issued2008-01
dc.identifier.citationJaruphongsa, 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
dc.identifier.issn18624472
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/63105
dc.description.abstractIn 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s11590-006-0042-1
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.doi10.1007/s11590-006-0042-1
dc.description.sourcetitleOptimization Letters
dc.description.volume2
dc.description.issue1
dc.description.page39-51
dc.identifier.isiut000261234300004
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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