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

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

Das Buch enthält ausgewählte Vorträge, die anläßlich der International Conference on Operations Research in der Zeit vom 30.8.-2.9.1994 an der TU Berlin gehalten wurden. Der Leser erhält einen Einblick in neueste Forschungsergebnisse auf dem Gebiet des Operations Research. Der entsprechend...