Benchmarks
Two types of benchmarks have been performed on a large set of scheduling problems:
- Extensive benchmarks against IBM CPLEX CP Optimizer.
- Benchmarks against the state-of-the-art.
Benchmarks against IBM ILOG CP Optimizer
The source code for the provided benchmarks is available in the public GitHub repository optalcp-benchmarks. All the benchmarks can be run using the Evaluation version of OptalCP.
The table below contains links to the detailed results. The setup is the following:
- Both solvers are using four workers (threads).
- CP Optimizer is using the default setting.
- OptalCP uses half of the workers for LNS (with default propagation settings) and the other half for Failure-Directed Search (with the maximum propagation levels).
- Openshop benchmark is an exception. It is too easy, so it is solved with only two workers for both solvers.
Benchmark | Results | Modeling features |
---|---|---|
Jobshop | Results | |
Jobshop with Operators | ||
Flexible Jobshop | Results | |
Jobshop TTJobshop with sequence-dependent Transition Times | Results | |
Openshop | Results | |
RCPSPResource Constrained Project Scheduling Problem | Results | |
MMRCPSPMulti-Model Resource Constrained Scheduling Problem | alternative,
pulse,
cumulLe, | |
RCPSP-CPRRCPSP with Consumption and Production of Resources | Results | endBeforeStart,
pulse,
cumulLe, |
Benchmarks against the state-of-the-art
Benchmarks against the state of the art are available as a separate GitHub site
In the benchmarks, you will find:
- a mathematical description of the problem and its main variants
- the instance files (usually > 1000) classified in
easy
,medium
,hard
oropen
- a description of the most common formats
- the best-known solutions from published results or engines (Cplex, CP Optimizer, OR-tools, OptalCP)
- list of relevant publications
- subsets of problems of interest (large, small but still open)
The most advanced state-of-the-art benchmarks, as of today, are:
The very first version of the benchmark was built on top of the outstanding work of Naderi, Ruiz and Roshanaei Mixed-Integer Programming versus Constraint Programming for shop scheduling problems : New Results and Outlook which compares CPO, Cplex and Gurobi on a benchmark of 6623 instances over 17 benchmarks with a timeout of 1h.
Because running multiple solvers on thousands of instances takes time, this benchmark is still under construction. We are working to add other types of problems (rcpsp and workforce scheduling).