Please use this identifier to cite or link to this item:
Title: Dynamic flexible job shop scheduling using double deep Q-network
Authors: Chua, Hui Shun
Keywords: Engineering::Industrial engineering::Supply chain
Engineering::Mechanical engineering
Issue Date: 2021
Publisher: Nanyang Technological University
Source: Chua, H. S. (2021). Dynamic flexible job shop scheduling using double deep Q-network. Final Year Project (FYP), Nanyang Technological University, Singapore.
Project: B173 
Abstract: The job shop scheduling problem (JSP) is a scheduling problem that aims to generate a near-optimal production schedule in a job shop. The flexible job shop scheduling problem (FJSP) is an extension of the JSP where each operation can be assigned on one or more available machines. The FJSP involves 2 problems: the machine selection problem and the job sequencing problem. The dynamic FJSP (DFJSP) considers dynamic events like job arrivals, job insertions, machine breakdowns and irregular processing times. Many methods such as metaheuristics, traditional reinforcement learning and deep reinforcement learning, have been used to solve dynamic scheduling problems like the DFJSP. However, research on the application of double deep Q-Network (DDQN)-based methods is limited. This report uses a DDQN-based approach to solve the DFJSP with new job arrivals. The objective is to minimize the total tardiness of the jobs at the flexible job shop. This approach uses two agents to solve the DFJSP. The design of the reward mechanism for the two agents is discussed. The performances of the individual agents and the combined model are benchmarked against some popular combined routing and sequencing rules. The results show that the combined model reduces the total tardiness of jobs by 4.60% compared to the best performing individual heuristic rules, resulting in a more optimal schedule and robust solution to the DFJSP. This report also explores how the percentage of tardy jobs and maximum job tardiness contribute to the total tardiness of jobs. Overall, this report provides insights on how DDQN-based approaches to the DFJSP can be improved.
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
2.18 MBAdobe PDFView/Open

Page view(s)

Updated on Dec 5, 2021


Updated on Dec 5, 2021

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.