A note on "The Economic Lot Sizing Problem with Inventory Bounds"
March 2012
Research Paper
pp 1-11.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(EI2012-04.pdf, 0.1MB) |
In a recent paper, Liu (2008) 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 O(n^2) complexity.
Automatically Extracted Terms
- period
- envelope
- point
- algorithm
- destination period
- replenishment period m
- solution
- destination
- computation
- replenishment
- origination period
- origination
- inventory
- ci +1
- value
- problem
- fficient
- period i
- monotonic search
- level
