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

In this paper an improved set of benchmark instances for the simple assembly line balancing problem is presented. The benchmark set currently available consists of instances with 7 to 297 tasks to be executed. Although claims made in the literature state that instances with up to 1000 tasks can...

While balancing straight assembly lines is a well-studied problem, the Situation where the assembly line has a U-shaped Iayout is a still emerging research field. The advantage of these lines is that workers may simply turn around to operate at two legs of the line. Hence, there is an additional...

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