Learning to generalize Dispatching rules on the Job Shop Scheduling

06/09/2022
by   Zangir Iklassov, et al.
0

This paper introduces a Reinforcement Learning approach to better generalize heuristic dispatching rules on the Job-shop Scheduling Problem (JSP). Current models on the JSP do not focus on generalization, although, as we show in this work, this is key to learning better heuristics on the problem. A well-known technique to improve generalization is to learn on increasingly complex instances using Curriculum Learning (CL). However, as many works in the literature indicate, this technique might suffer from catastrophic forgetting when transferring the learned skills between different problem sizes. To address this issue, we introduce a novel Adversarial Curriculum Learning (ACL) strategy, which dynamically adjusts the difficulty level during the learning process to revisit the worst-performing instances. This work also presents a deep learning model to solve the JSP, which is equivariant w.r.t. the job definition and size-agnostic. Conducted experiments on Taillard's and Demirkol's instances show that the presented approach significantly improves the current state-of-the-art models on the JSP. It reduces the average optimality gap from 19.35% to 10.46% on Taillard's instances and from 38.43% to 18.85% on Demirkol's instances. Our implementation is available online.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2023

Curriculum Learning in Job Shop Scheduling using Reinforcement Learning

Solving job shop scheduling problems (JSSPs) with a fixed strategy, such...
research
08/03/2023

Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach

Job scheduling is a well-known Combinatorial Optimization problem with e...
research
06/19/2020

The cyclic job-shop scheduling problem: The new subclass of the job-shop problem and applying the Simulated annealing to solve it

In the paper, the new approach to the scheduling problem are described. ...
research
10/03/2021

A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances

In recent years, we have witnessed tremendous progress in deep reinforce...
research
01/23/2023

Two-Stage Learning For the Flexible Job Shop Scheduling Problem

The Flexible Job-shop Scheduling Problem (FJSP) is an important combinat...
research
09/07/2021

Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning

The emergence of Industry 4.0 is making production systems more flexible...
research
09/30/2011

How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines

We characterize the search landscape of random instances of the job shop...

Please sign up or login with your details

Forgot password? Click here to reset