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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis-Doctor of Philosophy |
| Language: | English |
| Published: |
Nanyang Technological University
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/164926 |