计算机科学
人工神经网络
调度(生产过程)
工作车间
作业车间调度
运筹学
流水车间调度
人工智能
数学优化
数学
地铁列车时刻表
操作系统
作者
Igor G. Smit,Jianan Zhou,Robbert Reijnen,Yaoxin Wu,Jian Chen,Cong Zhang,Zaharah Allah Bukhsh,Yingqian Zhang,Wim Nuijten
标识
DOI:10.1016/j.cor.2024.106914
摘要
Job shop scheduling problems (JSSPs) represent a critical and challenging class of combinatorial optimization problems . Recent years have witnessed a rapid increase in the application of graph neural networks (GNNs) to solve JSSPs, albeit lacking a systematic survey of the relevant literature. This paper aims to thoroughly review prevailing GNN methods for different types of JSSPs and the closely related flow-shop scheduling problems (FSPs), especially those leveraging deep reinforcement learning (DRL). We begin by presenting the graph representations of various JSSPs, followed by an introduction to the most commonly used GNN architectures . We then review current GNN-based methods for each problem type, highlighting key technical elements such as graph representations, GNN architectures, GNN tasks, and training algorithms . Finally, we summarize and analyze the advantages and limitations of GNNs in solving JSSPs and provide potential future research opportunities. We hope this survey can motivate and inspire innovative approaches for more powerful GNN-based approaches in tackling JSSPs and other scheduling problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI