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:
Main Author: | Zhang, Cong |
---|---|
Other Authors: | - |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/164926 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Learning to dispatch for job shop scheduling via deep reinforcement learning
by: ZHANG, Cong, et al.
Published: (2020) -
Flexible job-shop scheduling via graph neural network and deep reinforcement learning
by: SONG, Wen, et al.
Published: (2023) -
Dynamic job shop scheduling using deep reinforcement learning
by: Tan, Hong Ming
Published: (2024) -
Deep reinforcement learning guided improvement heuristic for job shop scheduling
by: ZHANG, Cong, et al.
Published: (2024) -
Deep reinforcement learning for dynamic scheduling of a flexible job shop
by: Liu, Renke, et al.
Published: (2022)