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

Gegenstand der vorliegenden Arbeit sind zwei praktisch und theoretisch bedeutsame Probleme, die bei just-in-time orientierter Variantenfließfertigung auftreten. Ein Problem besteht darin, den Teilebedarf in der Endmontage so konstant wie möglich zu halten ("Level Scheduling Problem"). Das...

Since its advent, the 'just-in-time'-paradigm has considerable influence on production planning and control. While originally employed for high-volume production, 'just-in-time'-concepts are meanwhile documented for low-volume, make-to-order production as well. An example is the assembly of...