Sciweavers

COR
2007

Analysis of bounds for a capacitated single-item lot-sizing problem

13 years 7 months ago
Analysis of bounds for a capacitated single-item lot-sizing problem
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a range of fast algorithms. Special attention is given to LP-based rounding algorithms.
Jill R. Hardin, George L. Nemhauser, Martin W. P.
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2007
Where COR
Authors Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh
Comments (0)