This contribution defines an instance generator for capacitated, dynamic, multi-level lot sizing problems. It provides sophisticated methods for generating systematically varied parameter level combinations automatically. This helps to perform evaluations of lot sizing methods according to a...

Where standard MLP-solvers fail to compute optimum objective function values for certain MLP-model formulations, lower bounds may be used as a point of reference for evaluating heuristics. In this paper, we compute lower bounds for the multi-level proportional lot sizing and scheduling problem...

This contribution introduces a mixed-integer programming formulation for the multi-level, multi-machine proportional lot sizing and scheduling problem. It also presents a genetic algorithm to solve that problem. The efficiency of that algorithm is due to an encoding of solutions which uses a...