Explore a comprehensive collection of Job Shop Scheduling Problem (JSSP) benchmarks. These benchmarks represent various levels of complexity within scheduling and optimization scenarios, commonly used for testing and improving algorithms in operations research.
Hover over any benchmark to see the size of the problem in terms of jobs and machines, and discover the best-known optimal solution. Click on a benchmark to attempt solving it and see if you can match or improve upon the known optimum.