Learning topological representations with bidirectional graph attention network for solving job shop scheduling problem
Existing learning-based methods for solving job shop scheduling problems (JSSP) usually use off-the-shelf GNN models tailored to undirected graphs and neglect the rich and meaningful topological structures of disjunctive graphs (DGs). This paper proposes the topology-aware bidirectional graph attent...
Saved in:
Main Authors: | ZHANG, Cong, CAO, Zhiguang, WU, Yaoxin, SONG, Wen, SUN, Jing |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9331 https://ink.library.smu.edu.sg/context/sis_research/article/10331/viewcontent/3_Learning_Topological_Represe.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Deep reinforcement learning guided improvement heuristic for job shop scheduling
by: ZHANG, Cong, et al.
Published: (2024) -
Flexible job-shop scheduling via graph neural network and deep reinforcement learning
by: SONG, Wen, et al.
Published: (2023) -
A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem
by: Nguyen, S., et al.
Published: (2014) -
A Hybridized Approach for Solving Group Shop Problems (GSP)
by: TAN MU YEN
Published: (2010) -
Improved intelligent water drops optimization for single and multiple objective job shop scheduling
by: Ong, S.K., et al.
Published: (2014)