Learning to Optimize Job Shop Scheduling Under Structural Uncertainty
Rui Zhang, Jianwei Niu, Xuefeng Liu, Shaojie Tang, Jing Yuan
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper5
- Self-Labeling the Job Shop Scheduling ProblemAndrea Corsini, Angelo Porrello, Simone Calderara, Mauro Dell'AmicoNeurIPS 2024 · 被引用 39 次
- Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop SchedulingCong Zhang, Zhiguang Cao, Wen Song, Yaoxin Wu 等ICLR 2024 · 被引用 28 次
- Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning MethodJames Kotary, Ferdinando Fioretto, Pascal Van HentenryckAAAI 2022 · 被引用 27 次
- Learning Encodings for Constructive Neural Combinatorial Optimization Needs to RegretRui Sun, Zhi Zheng, Zhenkun WangAAAI 2024 · 被引用 19 次
- Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling ProblemsIgor G. Smit, Yaoxin Wu, Pavel Troubil, Yingqian Zhang 等AAAI 2025 · 被引用 1 次
相关 Paper
- 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 次
- Neural Combinatorial Optimization for Robust Routing Problem with Uncertain Travel TimesPei Xiao, Zizhen Zhang, Jinbiao Chen, Jiahai Wang 等NeurIPS 2024 · 被引用 13 次
- Information-based Value Iteration Networks for Decision Making Under UncertaintyCynthia Chen, Samantha Johnson, Cindy Poo, Michael A Buice 等ICLR 2026
- Visual-Enhanced Multimodal Framework for Flexible Job Shop Scheduling ProblemPeng Zhao, Zhiguang Cao, Di Wang, Wen Song 等ACM MM 2025 · 被引用 1 次
- RESCHED: Rethinking Flexible Job Shop Scheduling from a Transformer-based Architecture with Simplified StatesXiangjie Xiao, Cong Zhang, Wen Song, Zhiguang CaoICLR 2026 · 被引用 2 次
