# Large-Scale Benchmarks for the Job Shop Scheduling Problem

arXiv: https://arxiv.org/abs/2102.08778 · HTML: https://mlsanity.com/paper/2102.08778/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 16 references that are in the map.
- First posted on arXiv 25 Jan 2021.

## Builds on (most cited first, 1 of 1)

- [Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem](https://mlsanity.com/paper/1909.08247/) (2019)

## Abstract (arXiv)

This report contains the description of two novel job shop scheduling benchmarks that resemble instances of real scheduling problem as they appear in industry. In particular, the aim was to provide large-scale benchmarks (up to 1 million operations) to test the state-of-the-art scheduling solutions on problems that are closer to what occurs in a real industrial context. The first benchmark is an extension of the well known Taillard benchmark (1992), while the second is a collection of scheduling instances with a known-optimum solution.