Extended Invalid Action Mask: Training-Time Size-Agnostic Safe Reinforcement Learning for Flexible Job Shop Scheduling Problems

The flexible job shop scheduling problem (FJSP) is an NP-hard problem in which machine assignments are additionally considered compared to the classical job shop scheduling problem. It has received increased attention in recent years, as its global hard constraints highlight the importance of policy safety, especially in real production contexts. Deep reinforcement learning (DRL) has become a popular method for solving FJSP; however, ensuring both size-agnostic and safety-guaranteed properties during training remains challenging. Penalty-based approaches allow infeasible actions, degrading policy quality, while standard invalid action masking prevents training across different problem sizes. To address this, we propose an extended action-masking mechanism that maintains semantic consistency across varying scales while strictly enforcing action feasibility. Our framework integrates state and action embeddings to support adaptive scheduling and multi-scale training. Empirical results demonstrate improved performance over the latest DRL-based methods, indicating that our approach is scalable and robust for production scheduling.

Authors

Institutions

Publication Details

Published
2025-08-17
DOI
https://doi.org/10.1109/case58245.2025.11163782
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Extended Invalid Action Mask: Training-Time Size-Agnostic Safe Reinforcement Learning for Flexible Job Shop Scheduling Problems

Jianfeng Mao, Weilin Cai, Yuwei Chen, Zhaoli Wang et al.
Scheduling and Optimization Algorithms
article

Extended Invalid Action Mask: Training-Time Size-Agnostic Safe Reinforcement Learning for Flexible Job Shop Scheduling Problems

Jianfeng Mao, Weilin Cai, Yuwei Chen, Zhaoli Wang, Wenjun Zheng
article en

Abstract

The flexible job shop scheduling problem (FJSP) is an NP-hard problem in which machine assignments are additionally considered compared to the classical job shop scheduling problem. It has received increased attention in recent years, as its global hard constraints highlight the importance of policy safety, especially in real production contexts. Deep reinforcement learning (DRL) has become a popular method for solving FJSP; however, ensuring both size-agnostic and safety-guaranteed properties during training remains challenging. Penalty-based approaches allow infeasible actions, degrading policy quality, while standard invalid action masking prevents training across different problem sizes. To address this, we propose an extended action-masking mechanism that maintains semantic consistency across varying scales while strictly enforcing action feasibility. Our framework integrates state and action embeddings to support adaptive scheduling and multi-scale training. Empirical results demonstrate improved performance over the latest DRL-based methods, indicating that our approach is scalable and robust for production scheduling.

Chinese University of Hong Kong, Shenzhen (CN)
Openalex Percentile: Top 64%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Extended Invalid Action Mask: Training-Time Size-Agnostic Safe Reinforcement Learning for Flexible Job Shop Scheduling Problems — Jianfeng Mao, Weilin Cai, et al. · (2025) | TGRS Research Map | TGRS