EconPapers    
Economics at your fingertips  
 

A Multi-Agent Reinforcement Learning Approach to the Dynamic Job Shop Scheduling Problem

Ali Fırat İnal (), Çağrı Sel, Adnan Aktepe, Ahmet Kürşad Türker and Süleyman Ersöz
Additional contact information
Ali Fırat İnal: Department of Industrial Engineering, Kirikkale University, Kirikkale 71450, Turkey
Çağrı Sel: Department of Industrial Engineering, Karabük University, Karabük 78050, Turkey
Adnan Aktepe: Department of Industrial Engineering, Kirikkale University, Kirikkale 71450, Turkey
Ahmet Kürşad Türker: Department of Industrial Engineering, Kirikkale University, Kirikkale 71450, Turkey
Süleyman Ersöz: Department of Industrial Engineering, Kirikkale University, Kirikkale 71450, Turkey

Sustainability, 2023, vol. 15, issue 10, 1-24

Abstract: In a production environment, scheduling decides job and machine allocations and the operation sequence. In a job shop production system, the wide variety of jobs, complex routes, and real-life events becomes challenging for scheduling activities. New, unexpected events disrupt the production schedule and require dynamic scheduling updates to the production schedule on an event-based basis. To solve the dynamic scheduling problem, we propose a multi-agent system with reinforcement learning aimed at the minimization of tardiness and flow time to improve the dynamic scheduling techniques. The performance of the proposed multi-agent system is compared with the first-in–first-out, shortest processing time, and earliest due date dispatching rules in terms of the minimization of tardy jobs, mean tardiness, maximum tardiness, mean earliness, maximum earliness, mean flow time, maximum flow time, work in process, and makespan. Five scenarios are generated with different arrival intervals of the jobs to the job shop production system. The results of the experiments, performed for the 3 × 3, 5 × 5, and 10 × 10 problem sizes, show that our multi-agent system overperforms compared to the dispatching rules as the workload of the job shop increases. Under a heavy workload, the proposed multi-agent system gives the best results for five performance criteria, which are the proportion of tardy jobs, mean tardiness, maximum tardiness, mean flow time, and maximum flow time.

Keywords: dynamic job shop scheduling problem; multi-agent system; reinforcement learning; Industry 4.0; dispatching rules (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2071-1050/15/10/8262/pdf (application/pdf)
https://www.mdpi.com/2071-1050/15/10/8262/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:15:y:2023:i:10:p:8262-:d:1150542

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-03-19
Handle: RePEc:gam:jsusta:v:15:y:2023:i:10:p:8262-:d:1150542