Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.orl.2005.05.014
Title: Dynamic lot-sizing model with demand time windows and speculative cost structure
Authors: Hwang, H.-C.
Jaruphongsa, W. 
Keywords: Demand time window
Dynamic lot-sizing model
Dynamic programming
Speculative motive
Issue Date: May-2006
Source: 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
URI: http://scholarbank.nus.edu.sg/handle/10635/63104
ISSN: 01676377
DOI: 10.1016/j.orl.2005.05.014
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

17
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

15
checked on Nov 22, 2017

Page view(s)

53
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


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