Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities"
In a recent paper Gutiérrez et al. (2008) show that the lot-sizing problem with inventory bounds can be solved in O(T log T) time. In this note we show that their algorithm does not lead to an optimal solution in general.
|Keywords||Inventory, inventory bounds, lot-sizing|
|Publisher||Erasmus School of Economics (ESE)|
van den Heuvel, W.J., Gutierrez, J.M., & Hwang, H.C.. (2010). Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities" (No. EI 2010-70). Report / Econometric Institute, Erasmus University Rotterdam (pp. 1–9). Erasmus School of Economics (ESE). Retrieved from http://hdl.handle.net/1765/21933