This paper deals with lot sizing and scheduling for a single-stage production System where setup costs and times are sequence dependent. A large bücket mixed integer programming (MIP) model is formulated which considers only efficient sequences. A tailor-made enumeration method of the...

Three types of multi-item capacitated dynamic lotsizing and scheduling models are well established until now: The capacitated lotsizing problem, the discrete lotsizing and scheduling problem as well as the continuous setup lotsizing problem. An analysis of the underlying fundamental assumptions...

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

This contribution summarizes recent work in the field of lot sizing and scheduling. The objective is not to give a comprehensive literature survey, but to explain differences of formal models and to provide some first readings recommendations. Our focus is on capacitated, dynamic, and...

A new model is presented for capacitated lot-sizing with sequence dependent setup costs. The model is solved heuristically with a backward oriented method; the sequence and lot-size decisions are based on a priority rule which consists of a convex combination of setup and holding costs. 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...