2012-03-01
A note on "The Economic Lot Sizing Problem with Inventory Bounds"
Publication
Publication
Report / Econometric Institute, Erasmus University Rotterdam p. 1- 11
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.
| Additional Metadata | |
|---|---|
| Erasmus School of Economics | |
| hdl.handle.net/1765/32133 | |
| Econometric Institute Research Papers | |
| Report / Econometric Institute, Erasmus University Rotterdam | |
| Organisation | Erasmus School of Economics |
|
Onal, M., van den Heuvel, W., & Liu, T. (2012). A note on "The Economic Lot Sizing Problem with Inventory Bounds" (No. EI 2012-04). Report / Econometric Institute, Erasmus University Rotterdam (pp. 1–11). Retrieved from http://hdl.handle.net/1765/32133 |
|
