A note on %26quot;The economic lot sizing problem with inventory bounds%26quot;

作者：Onal Mehmet^*; van den Heuvel Wilco; Liu Tieming

来源：European Journal of Operational Research, 2012, 223(1): 290-294.

DOI：10.1016/j.ejor.2012.05.019

• Inventory
• Economic lot sizing
• Dynamic programming

In a recent paper, Liu [3] 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 0(n2) complexity.

• 出版日期2012-11-16