Please use this identifier to cite or link to this item:
|Title:||Dynamic lot-sizing model with demand time windows and speculative cost structure|
|Keywords:||Demand time window|
Dynamic lot-sizing model
|Citation:||Hwang, H.-C., Jaruphongsa, W. (2006-05). Dynamic lot-sizing model with demand time windows and speculative cost structure. Operations Research Letters 34 (3) : 251-256. ScholarBank@NUS Repository. https://doi.org/10.1016/j.orl.2005.05.014|
|Abstract:||We consider a deterministic lot-sizing problem with demand time windows, where speculative motive is allowed. Utilizing an untraditional decomposition principle, we provide an optimal algorithm that runs in O(nT3) time, where n is the number of demands and T is the length of the planning horizon. © 2005 Elsevier B.V. All rights reserved.|
|Source Title:||Operations Research Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 21, 2018
WEB OF SCIENCETM
checked on Apr 25, 2018
checked on May 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.