Benchmark of scheduling problems
This benchmark of scheduling problems is intended to compare scheduling engines to the state-of-the-art techniques (heuristics, meta-heuristics, decompositions, etc)
- IBM ILOG Cplex : a state-of-the-art MIP engine
- IBM ILOG CP Optimizer : representative of the CP-scheduling family of engines
- Google CP-SAT : representative of the lazy clause generation family of engines
- OptalCP : representative of the CP-scheduling family of engines
The problems that are benchmarked so far are
We are working on adding rcpsp and workforce scheduling problems (stay tuned…)
The data and source code can be found in the Github repository. One document per type of problem (jobshop, flexible jobshop, …) provides
- Instance repository — a centralized set of classic instances
- Engine benchmark — a standardized 10-minute comparison of reference solvers (CPO, CP-SAT, OptalCP, Cplex), measuring each engine’s optimality gap and deviation from the best known bounds.
- Best-known-solutions archive — a running record of the best upper/lower bounds ever found for each instance, from any source (published papers, meta-heuristics, or engine runs) — not limited to the reference engines above.
Each summary document is visible as a README.md in the Github folder (jobshop, flexible jobshop) or as webpages (jobshop, flexible jobshop)
The benchmark, best known solutions, repository and website are maintained by OptalCP that is also the editor of the OptalCP scheduling engine. The benchmark was initially meant as a training dataset for OptalCP tuning and was subsequently made public.
Other interesting repositories include