Intelligent job shop scheduling via deep reinforcement learning over graphs
Job Shop Scheduling Problem (JSSP) is a well-known NP-hard combinatorial optimization problem (COP) with extensive applications in today’s manufacturing system. Due to its NP-hardness, approximation, heuristic, and meta-heuristic algorithms have been proposed in the past. These methods have some li...
Saved in:
主要作者: | Zhang, Cong |
---|---|
其他作者: | - |
格式: | Thesis-Doctor of Philosophy |
語言: | English |
出版: |
Nanyang Technological University
2023
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/164926 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Learning to dispatch for job shop scheduling via deep reinforcement learning
由: ZHANG, Cong, et al.
出版: (2020) -
Flexible job-shop scheduling via graph neural network and deep reinforcement learning
由: SONG, Wen, et al.
出版: (2023) -
Dynamic job shop scheduling using deep reinforcement learning
由: Tan, Hong Ming
出版: (2024) -
Deep reinforcement learning guided improvement heuristic for job shop scheduling
由: ZHANG, Cong, et al.
出版: (2024) -
Deep reinforcement learning for dynamic scheduling of a flexible job shop
由: Liu, Renke, et al.
出版: (2022)