Communication Dans Un Congrès Année : 2025

Integrating Q-Learning with Branch and Bound for the Job Shop Scheduling Problem

Résumé

The integration of machine learning (ML), particularly reinforcement learning (RL), techniques with classical optimization methods has shown significant potential in addressing the computational challenges of complex combinatorial problems. This paper presents a novel approach that enhances the Branch and Bound (B&B) algorithm with Q-learning, a type of model-free RL, applied to the Job Shop Scheduling Problem (JSSP). While B&B is a powerful method for finding optimal solutions, its computational demands are often prohibitive for large instances. By incorporating Q-learning into the B&B framework (BBQL), the proposed method learns to prioritize promising branches, thereby improving search efficiency and reducing computational overhead. We evaluate BBQL against the classic B&B algorithm on standard JSSP benchmarks. Experimental results indicate that BBQL achieves better makespan results with significantly lower computational costs, highlighting the potential of reinforcement learning to enhance traditional optimization frameworks in scheduling applications. This research offers insights into how AI-driven guidance can improve exact optimization methods, providing a scalable solution to complex scheduling challenges.

Fichier principal
Vignette du fichier
1-s2.0-S2405896325008572-main.pdf (801.86 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence

Dates et versions

hal-05306175 , version 1 (09-10-2025)

Licence

Identifiants

Citer

Ayoub Ouhadi, Zakaria Yahouni, Maria Di Mascolo. Integrating Q-Learning with Branch and Bound for the Job Shop Scheduling Problem. 11th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2025, Jun 2025, Trondheim, Norway. pp.560 - 565, ⟨10.1016/j.ifacol.2025.09.096⟩. ⟨hal-05306175⟩
114 Consultations
271 Téléchargements

Altmetric

Partager

  • More