A fix-and-optimize approach for the multi-level capacitated lot sizing problem

A fix-and-optimize approach for the multi-level capacitated lot sizing problem

0.00 Avg rating0 Votes
Article ID: iaor20101068
Volume: 123
Issue: 2
Start Page Number: 247
End Page Number: 256
Publication Date: Feb 2010
Journal: International Journal of Production Economics
Authors: ,
Keywords: lot sizing
Abstract:

This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables. The remaining binary setup variables are tentatively fixed to values determined in previous iterations. The resulting algorithm is transparent, flexible, accurate and relatively fast. Its solution quality outperforms those of the approaches by Tempelmeier/Derstroff and by Stadtler.

Reviews

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