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

INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.