A note on "The economic lot sizing problem with inventory bounds"
Yükleniyor...
Dosyalar
Tarih
2012-11-06
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier Science BV
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Inventory, Economic lot sizing, Dynamic programming, Time, Inventory bounds, Inventory levels, Lot sizing, Lot sizing problems, Lower and upper bounds, Optimal solutions, Mathematical models, Operations research, Algorithms, Lot sizing, Production control, Capacitated lot
Kaynak
European Journal of Operational Research
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
223
Sayı
1
Künye
Önal, M., Heuvel, W. & Liu, T. (2012). A note on "the economic lot sizing problem with inventory bounds". European Journal of Operational Research, 223(1), 290-294. doi:10.1016/j.ejor.2012.05.019
