The problem of scheduling multiple, large scale, make-to-order assemblies is considered. Beside "classical" precedence- and resource constraints as known from resource constrained project scheduling we take spatial resource and part availability constraints into account. The objective is to...

We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high volume, discrete make-to-order products. Based on a list scheduling procedure which has...

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

This contribution discusses the measurement of (in-)stability of finite horizon production planning when done on a rolling horizon basis. As examples we review strategic capacity expansion planning, tactical master production schedulng, and operational capacitated lot sizing.

The car sequencing problem is to find feasible sequences of product variants requiring specific options while taking care of sequencing constraints. First, a branching scheme and constraint propagation algorithms for the computation of feasible sequences are provided. Second, an algorithm is...

Zur Lösung des Economic Lot Scheduling Problems (ELSP) finden sich in der Literatur drei Ansätze mit unterschiedlich einschränkenden Annahmen: - Ansatz des gemeinsamen Produktzyklus (Common-Cycle-Approach) - Ansatz der gemeinsamen Basisperiode (Basic-Period-Approach) - Ansatz der variierenden...