| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 476318 | Computers & Operations Research | 2007 | 23 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jill R. Hardin, George L. Nemhauser, Martin W.P. Savelsbergh,