کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
478367 1446068 2012 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A note on “The economic lot sizing problem with inventory bounds”
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
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)O(n2) algorithm for the general problem, and an O(n)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)O(n2) complexity.


► Algorithms by Liu for economic lot sizing with inventory bounds are not correct.
► We present numerical examples to illustrate this.
► We fix those algorithms and analyze the complexity of the new algorithms.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 223, Issue 1, 16 November 2012, Pages 290–294
نویسندگان
, , ,