Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities"
AbstractIn a recent paper GutiÃ©rrez et al. (2008) show that the lot-sizing problem with inventory bounds can be solved in O(T log T) time. In this note we show that their algorithm does not lead to an optimal solution in general.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI 2010-70.
Date of creation: 22 Dec 2010
Date of revision:
Contact details of provider:
Web page: http://www.few.eur.nl/few
lot-sizing; Inventory; inventory bounds;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hwang, H-C. & Heuvel, W. van den, 2010. "Improved Algorithms for a Lot-Sizing Problem with Inventory Bounds and Backlogging," Econometric Institute Report EI 2010-17, Erasmus University Rotterdam, Econometric Institute.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anneke Kop).
If references are entirely missing, you can add them using this form.