Learning to Optimize Job Shop Scheduling Under Structural Uncertainty

Authors

  • Rui Zhang State Key Laboratory of Virtual Reality Technology and Systems, School of Computer Science and Engineering, Beihang University, Beijing, China Zhongguancun Laboratory, Beijing, China
  • Jianwei Niu State Key Laboratory of Virtual Reality Technology and Systems, School of Computer Science and Engineering, Beihang University, Beijing, China Hangzhou Innovation Institute of Beihang University, Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems, Hangzhou, China Zhongguancun Laboratory, Beijing, China
  • Xuefeng Liu State Key Laboratory of Virtual Reality Technology and Systems, School of Computer Science and Engineering, Beihang University, Beijing, China Zhongguancun Laboratory, Beijing, China
  • Shaojie Tang Department of Management Science and Systems, University at Buffalo, Buffalo, New York, USA
  • Jing Yuan University of North Texas, Denton, Texas, USA

DOI:

https://doi.org/10.1609/aaai.v40i43.40973

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.

Downloads

Published

2026-03-14

How to Cite

Zhang, R., Niu, J., Liu, X., Tang, S., & Yuan, J. (2026). Learning to Optimize Job Shop Scheduling Under Structural Uncertainty. Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), 36509–36517. https://doi.org/10.1609/aaai.v40i43.40973

Issue

Section

AAAI Technical Track on Planning, Routing, and Scheduling