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:
書目詳細資料
主要作者: Chua, Hui Shun
其他作者: Rajesh Piplani
格式: Final Year Project
語言:English
出版: Nanyang Technological University 2021
主題:
在線閱讀:https://hdl.handle.net/10356/150878
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!