Attention-based Reinforcement Learning for Combinatorial Optimization: Application to Job Shop Scheduling Problem

Author:

Jaejin Lee, Seho Kee, Mani Janakiram, George Runger

Keyword:

Computer Science, Artificial Intelligence, Artificial Intelligence (cs.AI)

journal:

date:

2024-01-29 00:00:00

Abstract

Job shop scheduling problems are one of the most important and challenging combinatorial optimization problems that have been tackled mainly by exact or approximate solution approaches. However, finding an exact solution can be infeasible for real-world problems, and even with an approximate solution approach, it can require a prohibitive amount of time to find a near-optimal solution, and the found solutions are not applicable to new problems in general. To address these challenges, we propose an attention-based reinforcement learning method for the class of job shop scheduling problems by integrating policy gradient reinforcement learning with a modified transformer architecture. An important result is that our trained learners in the proposed method can be reused to solve large-scale problems not used in training and demonstrate that our approach outperforms the results of recent studies and widely adopted heuristic rules.

PDF: Attention-based Reinforcement Learning for Combinatorial Optimization: Application to Job Shop Scheduling Problem.pdf