A note on "The Economic Lot Sizing Problem with Inventory Bounds"

Mehmet Onal, Wilco van den Heuvel and Tieming Liu

No EI 2012-04, Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute

Abstract: In a recent paper, Liu (2008) considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n^2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains the O(n^2) complexity.

Date: 2012-03-01
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://repub.eur.nl/pub/32133/EI2012-04.pdf (application/pdf)

Related works:
Journal Article: A note on “The economic lot sizing problem with inventory bounds” (2012)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ems:eureir:32133

Access Statistics for this paper

More papers in Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute Contact information at EDIRC.
Bibliographic data for series maintained by RePub ( this e-mail address is bad, please contact ).