Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 531
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 presented which can optimize a level scheduling objective while taking care of the car sequencing constraints. Computational results are presented which show that feasible sequences can be obtained quickly for large problem instances.
Car Sequencing Level Scheduling Constraint Propagation Algorithms Computational Results