Please use this identifier to cite or link to this item:
|Title:||Dynamic lot-sizing model for major and minor demands|
|Keywords:||Agreeable time windows|
|Citation:||Hwang, H.-C., Jaruphongsa, W. (2008-01-16). Dynamic lot-sizing model for major and minor demands. European Journal of Operational Research 184 (2) : 711-724. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2006.11.017|
|Abstract:||This paper deals with a lot-sizing model for major and minor demands in which major demands are specified by time windows while minor demands are given by periods. For major demands, the agreeable time window structure is assumed where each time window is not strictly nested in any other time windows. To incorporate the economy of scale of large production quantity, especially from major demands, concave cost structure in production must be considered. Investigating the optimality properties, we propose optimal solution procedures based on dynamic program. For a simple case when only major demands exist, we propose an optimal procedure with running time of O (n2 T) where n is the number of demands and T is the length of the planning horizon. Extending the algorithm to the model with major and minor demands, we propose an algorithm with complexity O (n2 T2). © 2006 Elsevier B.V. All rights reserved.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 21, 2019
WEB OF SCIENCETM
checked on Jan 2, 2019
checked on Jan 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.