A note on “The economic lot sizing problem with inventory bounds”

Mehmet Önal, Wilco van den Heuvel and Tieming Liu

European Journal of Operational Research, 2012, vol. 223, issue 1, 290-294

Abstract: In a recent paper, Liu [3] considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) 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(n2) complexity.

Keywords: Inventory; Economic lot sizing; Dynamic programming (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221712003682
Full text for ScienceDirect subscribers only

Related works:
Working Paper: 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:eee:ejores:v:223:y:2012:i:1:p:290-294

DOI: 10.1016/j.ejor.2012.05.019

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().