Learning to Optimize Job Shop Scheduling Under Structural Uncertainty
Rui Zhang, Jianwei Niu, Xuefeng Liu, Shaojie Tang, Jing Yuan
Abstract
The Job-Shop Scheduling Problem (JSSP), under various forms of manufacturing uncertainty, has recently attracted considerable research attention. Most existing studies focus on parameter uncertainty, such as variable processing times, and typically adopt the actor-critic framework. In this paper, we explore a different but prevalent form of uncertainty in JSSP: structural uncertainty. Structural uncertainty arises when a job may follow one of several routing paths, and the selection is determined not by policy, but by situational factors (e.g., the quality of intermediate products) that cannot be known in advance. Existing methods struggle to address this challenge due to incorrect credit assignment: a high-quality action may be unfairly penalized if it is followed by a time-consuming path. To address this problem, we propose a novel method named UP-AAC. In contrast to conventional actor-critic methods, UP-AAC employs an asymmetric architecture. While its actor receives a standard stochastic state, the critic is crucially provided with a deterministic state reconstructed in hindsight. This design allows the critic to learn a more accurate value function, which in turn provides a lower-variance policy gradient to the actor, leading to more stable learning. In addition, we design an attention-based Uncertainty Perception Model (UPM) to enhance the actor's scheduling decisions. Extensive experiments demonstrate that our method outperforms existing approaches in reducing makespan on benchmark instances.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3b61d18b-3507-4765-aca0-7cacdf00faa1Builds on5
- Self-Labeling the Job Shop Scheduling ProblemAndrea Corsini, Angelo Porrello, Simone Calderara, Mauro Dell'AmicoNeurIPS 2024 · 39 citations
- Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop SchedulingCong Zhang, Zhiguang Cao, Wen Song, Yaoxin Wu et al.ICLR 2024 · 28 citations
- Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning MethodJames Kotary, Ferdinando Fioretto, Pascal Van HentenryckAAAI 2022 · 27 citations
- Learning Encodings for Constructive Neural Combinatorial Optimization Needs to RegretRui Sun, Zhi Zheng, Zhenkun WangAAAI 2024 · 19 citations
- Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling ProblemsIgor G. Smit, Yaoxin Wu, Pavel Troubil, Yingqian Zhang et al.AAAI 2025 · 1 citation
Related papers
- Towards Variance Reduction for Reinforcement Learning of Industrial Decision-making Tasks: A Bi-Critic based Demand-Constraint Decoupling ApproachJianyong Yuan, Jiayi Zhang, Zinuo Cai, Junchi YanKDD 2023 · 4 citations
- Neural Combinatorial Optimization for Robust Routing Problem with Uncertain Travel TimesPei Xiao, Zizhen Zhang, Jinbiao Chen, Jiahai Wang et al.NeurIPS 2024 · 13 citations
- Information-based Value Iteration Networks for Decision Making Under UncertaintyCynthia Chen, Samantha Johnson, Cindy Poo, Michael A Buice et al.ICLR 2026
- Visual-Enhanced Multimodal Framework for Flexible Job Shop Scheduling ProblemPeng Zhao, Zhiguang Cao, Di Wang, Wen Song et al.ACM MM 2025 · 1 citation
- RESCHED: Rethinking Flexible Job Shop Scheduling from a Transformer-based Architecture with Simplified StatesXiangjie Xiao, Cong Zhang, Wen Song, Zhiguang CaoICLR 2026 · 2 citations
