Please use this identifier to cite or link to this item:
|Title:||The economic lot scheduling problem under extended basic period and power-of-two policy||Authors:||Sun, H.
Parametric search algorithm
|Issue Date:||2010||Citation:||Sun, H., Huang, H.-C., Jaruphongsa, W. (2010). The economic lot scheduling problem under extended basic period and power-of-two policy. Optimization Letters 4 (2) : 157-172. ScholarBank@NUS Repository. https://doi.org/10.1007/s11590-009-0154-5||Abstract:||The economic lot scheduling problem schedules the production of several different products on a single machine over an infinite planning horizon. In this paper, a nonlinear integer programming model is used to determine the optimal solution under the extended basic period and power-of-two policy. A small-step search algorithm is presented to find a solution which approaches optimal when the step size approaches zero, where a divide-and-conquer procedure is introduced to speed up the search. Further a faster heuristic algorithm is proposed which finds the same solutions in almost all the randomly generated sample cases. © 2009 Springer-Verlag.||Source Title:||Optimization Letters||URI:||http://scholarbank.nus.edu.sg/handle/10635/63358||ISSN:||18624472||DOI:||10.1007/s11590-009-0154-5|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 8, 2019
WEB OF SCIENCETM
checked on Oct 31, 2019
checked on Oct 27, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.