Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities"
October 2011
Research Paper
pp 1-9.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(EI2011-39.pdf, 0.1MB) |
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.
Automatically Extracted Terms
- period
- guti ´rrez
- point
- ´rrez
- problem
- period t
- envelope
- algorithm
- inventory
- slope
- period j
- ......
- production
- lot-sizing problem
- solution
- figure
- inventory bounds
- ....
- demand
- fficient
