A Note on "The Economic Lot Sizing Problem With Inventory Bounds"

M Onal, Wilco van den Heuvel, T Liu

Research output: Contribution to journalArticleAcademicpeer-review

12 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)290-294
Number of pages5
JournalEuropean Journal of Operational Research
Volume223
Issue number1
DOIs
Publication statusPublished - 2012

Fingerprint

Dive into the research topics of 'A Note on "The Economic Lot Sizing Problem With Inventory Bounds"'. Together they form a unique fingerprint.

Cite this