Work

Mixed-integer versus Constraint Programming Solvers: An Extensive Comparison with the Job Shop Scheduling Problem

Year: 2026

Type: conference-paper

Abstract: This paper compares free/open-source and commercial solvers of mixed-integer programming (MILP) and constraint programming (CP) in the classic job shop scheduling problem (JSSP) with makespan and total flowtime minimization. We implemented a MILP model and solved it with CPLEX, Gurobi, and HIGS solvers, and we also implemented and solved CP models with IBM CP, Hexaly, and OR-Tools solvers. We conducted computational experiments using 80 well-known Taillard instance sets. The extensive computational experience shows that the MILP model is promising for solving small-sized instances, and the CP model got the best average relative deviation and superior performance in large-sized instances. The solver IBM CP got the best average results.

Source: Proceeding Series of the Brazilian Society of Computational and Applied Mathematics

DOI: 10.5540/03.2026.012.01.0308

Author: Levi R. Abreu

Institution: Universidade Federal do Ceará

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: diamond

Funders: Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, Conselho Nacional de Desenvolvimento Científico e Tecnológico

OpenAlex ID: W7128820611

FWCI: 9.603

Cites: 6

Cited by: 1

Related to: 10