In a recent paper Gutierrez 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.

Additional Metadata
Publisher Erasmus School of Economics (ESE)
Persistent URL hdl.handle.net/1765/30665
Citation
van den Heuvel, W, Gutierrez, J.M, & Hwang, H.C. (2011). Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities" (No. EI 2011-39). Report / Econometric Institute, Erasmus University Rotterdam (pp. 1–9). Erasmus School of Economics (ESE). Retrieved from http://hdl.handle.net/1765/30665