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: | |
---|---|
Other Authors: | |
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 |