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

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

0.00 Avg rating0 Votes
Article ID: iaor20082324
Country: United Kingdom
Volume: 34
Issue: 6
Start Page Number: 1721
End Page Number: 1743
Publication Date: Jun 2007
Journal: Computers and Operations Research
Authors: , ,
Keywords: programming: linear
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.

Reviews

Required fields are marked *. Your email address will not be published.