Kärcher, Jens; Meyr, Herbert - In: OR Spectrum 47 (2025) 3, pp. 889-931
For some NP-hard lotsizing problems, many different heuristics exist, but they have different solution qualities and computation times depending on the characteristics of the instance. The computation times of the individual heuristics increase significantly with the problem size, so that...