Dynamic flexible job shop scheduling using double deep Q-network
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...
Saved in:
Main Author: | Chua, Hui Shun |
---|---|
Other Authors: | Rajesh Piplani |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/150878 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Deep reinforcement learning for dynamic scheduling of a flexible job shop
by: Liu, Renke, et al.
Published: (2022) -
Dynamic order allocation in E-commerce supply network
by: Loo, Jia Lin
Published: (2023) -
The job dispatch control policy for production lines with overlapped time window constraints and constant processing times
by: Hu, Wei
Published: (2020) -
Combined production and distribution scheduling in ready mix concrete industry
by: Pang, Yoke Fong.
Published: (2008) -
Dynamic job shop scheduling using deep reinforcement learning
by: Tan, Hong Ming
Published: (2024)