Title of article
Analysis of bounds for a capacitated single-item lot-sizing problem
Author/Authors
Jill R. Hardin، نويسنده , , George L. Nemhauser، نويسنده , , Martin W.P. Savelsbergh، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2007
Pages
23
From page
1721
To page
1743
Abstract
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.
Journal title
Computers and Operations Research
Serial Year
2007
Journal title
Computers and Operations Research
Record number
928427
Link To Document