Advanced constraint propagation for the combined car sequencing and level scheduling problem

We present an advanced constraint propagation algorithm for the combined car sequencing and level scheduling problem, used within a branch-and-bound framework. The new method solves the only unsolved instance from Drexl et al. (2006) and four of the eight unsolved instances from Yavuz's (2013) testbeds. The paper also introduces 18 new instances, 9 of which are solved by the algorithm. Optimal sequences of up to 250 cars are obtained.