Paper
9 October 2023 On algorithms for JSSP based on hybrid graph neural network
Zexiang Shi, Zhibin Chen
Author Affiliations +
Proceedings Volume 12791, Third International Conference on Advanced Algorithms and Neural Networks (AANN 2023); 1279107 (2023) https://doi.org/10.1117/12.3004946
Event: Third International Conference on Advanced Algorithms and Neural Networks (AANN 2023), 2023, Qingdao, SD, China
Abstract
The Job-Shop Scheduling Problem (JSSP), one of the traditional scheduling issues in combinatorial optimization problems, has been the subject of much research for many years. In this study, to further take into account the influence of time sequence information on the operation between different processes, we develop a network architecture that combines graph neural networks and long short-term memory networks. We then train a policy network using proximal policy optimization to efficiently extract node features from JSSP disjunctive graphs and automate the learning of Priority Dispatch Rules (PDRs). The experimental results demonstrate that the proposed model for solving the JSSP problem has a high generalization performance and a global performance that is noticeably better than the current best PDRs, offering a useful approach for solving the JSSP problem.
(2023) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Zexiang Shi and Zhibin Chen "On algorithms for JSSP based on hybrid graph neural network", Proc. SPIE 12791, Third International Conference on Advanced Algorithms and Neural Networks (AANN 2023), 1279107 (9 October 2023); https://doi.org/10.1117/12.3004946
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Neural networks

Education and training

Evolutionary algorithms

Network architectures

Mathematical optimization

Algorithm development

Manufacturing

Back to Top