Benchmark of scheduling problems

This is a comprehensive benchmark library for various scheduling problem with three components:

• Instance repository — a centralized set of 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.

The problems that are benchmarked so far are

• Jobshop (JSPLib)
• Flexible jobshop (FJSPLib)

We are working on adding rcpsp and workforce scheduling problems (stay tuned…)

The reference engines used are

• 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

Other interesting repositories include

• IBM CP Optimizer examples
• OptalCP examples