A note on "The economic lot sizing problem with inventory bounds"

被引:12
作者
Onal, Mehmet [1 ]
van den Heuvel, Wilco [2 ]
Liu, Tieming [3 ]
机构
[1] Isik Univ, TR-34980 Istanbul, Turkey
[2] Erasmus Univ, Inst Econometr, Erasmus Sch Econ, NL-3000 DR Rotterdam, Netherlands
[3] Oklahoma State Univ, Sch Ind Engn & Management, Stillwater, OK 74078 USA
关键词
Inventory; Economic lot sizing; Dynamic programming; TIME;
D O I
10.1016/j.ejor.2012.05.019
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:290 / 294
页数:5
相关论文
共 7 条