This paper deals with proportional lot sizing and scheduling (PLSP) and gives some insights into the properties of this problem. Such insights may be useful for developing heuristic and/or exact solution procedures. The emphasis of this paper is on the multi-level, multi-machine case. We provide...

This contribution generalizes the work of Drexl and Haase about the so-called proportional lot sizing and scheduling problem which was published in 1995. While the early paper considers single-level cases only, the paper at hand describes multi-level problems. 1t provides mixed-integer programs...

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...

Recently, Branzei, Dimitrov, and Tijs (2003) introduced cooperative interval-valued games. Among other insights, the notion of an interval core has been coined and proposed as a solution concept for interval-valued games. In this paper we will present a general mathematical programming algorithm...