Conference Agenda
Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).
Please note that all times are shown in the time zone of the conference. The current conference time is: 24th Aug 2026, 06:28:18am America, Santiago
|
Daily Overview |
| Session | |
|
72D: Production Engineering Location: Room 06: Europa | |
| Presentation 3 | |
11:24am - 11:36am
Benchmarking Constraint Programming software: Insights from the Job Shop Scheduling Problem 1: Universidad Andrés Bello - (CL), Chile; 2: Universidad Nacional del Sur - (AR); 3: INMABB, CONICET - (AR) In this article, we benchmark three popular constraint programming (CP) solvers for the job shop scheduling problem (JSSP) under identical hardware and computation-time conditions, with the objective of minimizing the makespan. For evaluation purposes, we use 80 classic Taillard instances. Overall, CP Optimizer proved to be the most competitive solver, demonstrating optimality in 38 instances, despite a slightly higher average optimality gap (3.06%). OR-Tools followed closely, achieving a marginally smaller average gap of 2.86%, proving optimality in 23 instances, and consistently producing competitive lower bounds. In third place, Hexaly exhibited improved performance as the instance size increased. | |
