Large-Scale Benchmarks for the Job Shop Scheduling Problem
This provides incremental benchmarks for researchers and practitioners in operations research and scheduling to evaluate algorithms on more realistic industrial-scale problems.
The authors introduced two large-scale job shop scheduling benchmarks, including an extension of the Taillard benchmark and a collection with known-optimum solutions, to test state-of-the-art scheduling solutions on problems resembling real industrial contexts, with instances up to 1 million operations.
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.