Autoregressive DRL for Multi-Robot Scheduling in Semiconductor Cluster Tools

Deep reinforcement learning (DRL) has been widely applied to multi-robot scheduling, including semiconductor cluster tools, where maximizing throughput is critical. These tools operate under strict constraints, requiring precise coordination for efficient operation. However, managing multiple robots in such complex environments remains challenging. We propose an autoregressive DRL framework that sequentially generates robot actions using dynamic action masking, enabling context-aware decision making in large discrete action spaces. The agent is guided by a reward function that promotes step-wise progress, task completion, and reduced travel distance, encouraging efficient use of resources. Our approach demonstrates strong performance across representative tool configurations, highlighting the value of policy decomposition in complex scheduling tasks.

Authors

Institutions

Publication Details

Published
2025-06-20
DOI
https://doi.org/10.1109/isie62713.2025.11124688
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

Autoregressive DRL for Multi-Robot Scheduling in Semiconductor Cluster Tools

Jong‐Kook Kim, Jean Seong Bjorn Choe, Soo-Hwan Cho
Scheduling and Optimization Algorithms
article

Autoregressive DRL for Multi-Robot Scheduling in Semiconductor Cluster Tools

Jong‐Kook Kim, Jean Seong Bjorn Choe, Soo-Hwan Cho
article en

Abstract

Deep reinforcement learning (DRL) has been widely applied to multi-robot scheduling, including semiconductor cluster tools, where maximizing throughput is critical. These tools operate under strict constraints, requiring precise coordination for efficient operation. However, managing multiple robots in such complex environments remains challenging. We propose an autoregressive DRL framework that sequentially generates robot actions using dynamic action masking, enabling context-aware decision making in large discrete action spaces. The agent is guided by a reward function that promotes step-wise progress, task completion, and reduced travel distance, encouraging efficient use of resources. Our approach demonstrates strong performance across representative tool configurations, highlighting the value of policy decomposition in complex scheduling tasks.

Korea University (KR)
Openalex Percentile: Top 69%
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.