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

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.

MoreLess

Year of publication:	2012
Authors:	Önal, Mehmet ; van den Heuvel, Wilco ; Liu, Tieming
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 223.2012, 1, p. 290-294
Publisher:	Elsevier
Subject:	Inventory \| Economic lot sizing \| Dynamic programming

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011052442