Resource title

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

Resource image

image for OpenScout resource :: A fix-and-optimize approach for the multi-level capacitated lot sizing problem

Resource description

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.

Resource author

Stefan Helber, Florian Sahling

Resource publisher

Resource publish date

Resource language

eng

Resource content type

text/html

Resource resource URL

http://hdl.handle.net/10419/27203

Resource license

Adapt according to the presented license agreement and reference the original author.