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.

• Type: Journal
• Year: 2007
• Where: COR
• Authors: Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh
• Keywords: COR 2007, Cornerstone Optimization Problems, Fast Algorithms, LP-based Rounding Algorithms