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)

The engines that are benchmarked are

  • 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

  • A mathematical description of the problem and its main variants
  • The instance classified in easy, medium, hard, (presumed) closed or open
  • A description of the most common data formats for those instances
  • The best known solutions from published results or engines
  • A list of relevant publications (for problems and solutions)

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