Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482112 | European Journal of Operational Research | 2008 | 12 Pages |
Abstract
This paper studies a economic lot sizing (ELS) problem with both upper and lower inventory bounds. Bounded ELS models address inventory control problems with time-varying inventory capacity and safety stock constraints. An O(n2) algorithm is found by using net cumulative demand (NCD) to measure the amount of replenishment requested to fulfill the cumulative demand till the end of the planning horizon. An O(n) algorithm is found for the special case, the bounded ELS problem with non-increasing marginal production cost.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Tieming Liu,