Dual Operation Aggregation Graph Neural Networks for Solving Flexible Job-Shop Scheduling Problem with Reinforcement Learning
Peng Zhao, You Zhou, Di Wang, Zhiguang Cao, Yubin Xiao, Xuan Wu, Yuanshu Li, Hongjia Liu, Wei Du, Yuan Jiang, Liupu Wang
Abstract
With the widespread adoption of Internet Protocol (IP) communication technology and web-based platforms, cloud manufacturing has become a significant hallmark of Industry 4.0. Integrating graph algorithms into these web-enabled environments is crucial as they facilitate the representation and analysis of complex relationships in manufacturing processes, enabling efficient decision-making and adaptability in dynamic environments. As a key scheduling problem in cloud manufacturing, the flexible job-shop scheduling problem (FJSP) finds extensive applications in real-world scenarios. However, traditional FJSP-solving methods struggle to meet the efficiency and adaptability demands of cloud manufacturing due to generalization issues and excessive computational time, while reinforcement learning-based methods fail to learn relationships between FJSP nodes, such as interactions between operations of different jobs, leading to limited interpretability and performance. To address these issues, we propose a dual operation aggregation graph neural network (GNN) for solving FJSP. Specifically, we decouple the disjunctive graph into two distinct graphs, reducing graph density and clarifying relationships between machines and operations, thus enabling more effective aggregation and understanding by neural networks. We develop two distinct graph aggregation methods to minimize the influence of non-critical machine and operation nodes on decision-making while enhancing the model's ability to account for long-term benefits. Additionally, to achieve more accurate multi-objective estimation and mitigate reward sparsity, we design a reward function that simultaneously considers machine efficiency, schedule balance, and makespan minimization. Extensive experimental results on well-known datasets demonstrate that our model outperforms state-of-the-art models and exhibits excellent generalization capabilities, effectively addressing the challenges of cloud manufacturing.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get b69e18b5-c867-4cb6-9048-d8c564c6d683Cited by top-tier papers3
- RESCHED: Rethinking Flexible Job Shop Scheduling from a Transformer-based Architecture with Simplified StatesXiangjie Xiao, Cong Zhang, Wen Song, Zhiguang CaoICLR 2026 · 2 citations
- Dynamic Stratified Contrastive Learning with Upstream Augmentation for MILP BranchingTongkai Lu, Shuai Ma, Chongyang TaoICML 2026
- Learning Memory-Enhanced Improvement Heuristics for Flexible Job Shop SchedulingJiaqi Wang, Zhiguang Cao, Peng Zhao, Rui Cao et al.NeurIPS 2025
Related papers
- Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop SchedulingCong Zhang, Zhiguang Cao, Wen Song, Yaoxin Wu et al.ICLR 2024 · 28 citations
- Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement LearningCong Zhang, Wen Song, Zhiguang Cao, Jie Zhang et al.NeurIPS 2020 · 497 citations
- Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning MethodJames Kotary, Ferdinando Fioretto, Pascal Van HentenryckAAAI 2022 · 27 citations
- Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop SchedulingSirui Li, Wenbin Ouyang, Yining Ma, Cathy WuICLR 2025
- Neural Multi-Objective Combinatorial Optimization for Flexible Job Shop Scheduling ProblemsIgor G. Smit, Yaoxin Wu, Pavel Troubil, Yingqian Zhang et al.ICLR 2026 · 3 citations
