A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups

A batch sequencing model with sequence-dependent setup-times and -costs is used to compare modeling and solving with two different general solvers. ‘Conceptual models’ are implemented and solved using the constaint programming language CHARME. The mixed-integer-programming (MIP) formulation of the same problem is solved with OSL, a state-of-the-art MIP solver. We compare modeling in both solvers and the performance of the constraint versus the mixed-integer programming solver.