Large-Scale Benchmarks for the Job Shop Scheduling Problem

01/25/2021
by   Giacomo Da Col, et al.
0

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.

READ FULL TEXT
research
12/11/2022

A Hierarchical Temporal Planning-Based Approach for Dynamic Hoist Scheduling Problems

Hoist scheduling has become a bottleneck in electroplating industry appl...
research
08/24/2023

Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods

We introduce an open-source GitHub repository containing comprehensive b...
research
09/23/2020

The Scheduling Job-Set Optimization Problem: A Model-Based Diagnosis Approach

A common issue for companies is that the volume of product orders may at...
research
06/22/2020

Metaheuristics for the Online Printing Shop Scheduling Problem

In this work, the online printing shop scheduling problem introduced in ...
research
09/12/2022

Solving the Job Shop Scheduling Problem with Ant Colony Optimization

The Job Shop Schedule Problem (JSSP) refers to the ability of an agent t...
research
08/05/2022

Decomposition Strategies for Solving Scheduling Problems in Industrial Applications

This article presents an overview of a research study of a crucial optim...
research
09/18/2019

Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem

The job-shop scheduling is one of the most studied optimization problems...

Please sign up or login with your details

Forgot password? Click here to reset