Dynamic flexible job shop scheduling using double deep Q-network

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...

Full description

Bibliographic Details
Main Author: Chua, Hui Shun
Other Authors: Rajesh Piplani
Format: Final Year Project (FYP)
Language:English
Published: Nanyang Technological University 2021
Subjects:
Engineering::Industrial engineering::Supply chain
Engineering::Mechanical engineering
Online Access:https://hdl.handle.net/10356/150878

Internet

https://hdl.handle.net/10356/150878

Similar Items