mlsanityData to 7 Oct 2026

Learning to Optimize Job Shop Scheduling Under Structural Uncertainty

arXiv 2601.21389 ↗First posted 29 Jan 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 28 references that are in the map. First posted on arXiv 29 Jan 2026.

Builds on

7 of 28 references.

References · 7

  1. 2017Attention Is All You Needcited by 59,932
  2. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  3. 2020Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learningcited by 139
  4. 2018Set Transformer: A Framework for Attention-based Permutation-Invariant Neural Networkscited by 129
  5. 2021Learning to schedule job-shop problems: Representation and policy learning using graph neural network and reinforcement learningcited by 52
  6. 2021Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Methodcited by 20
  7. 2024Graph Neural Networks for Job Shop Scheduling Problems: A Surveycited by 15

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.