A multi-population cooperative Jaya algorithm with adaptive rescheduling strategy for dynamic scheduling in semiconductor manufacturing system

Time-window constraints (TWCs) and dynamic disruptions complicate semiconductor wafer fabrication scheduling. To address this issue, we present a rescheduling approach incorporating deep reinforcement learning and the multi-population Jaya algorithm (DRL-MPJA). An adaptive DRL-based rescheduling trigger handles uncertain events, and the DRL agent adaptively selects the optimal strategy by real-time states and rewards. For complete rescheduling, three sub-populations optimise makespan, schedule deviation, and TWC feasibility, forming a reference population and guiding sequence. GEPA provides unified evaluation, while GEPRG selects promising candidates based on similarity, enabling cooperative optimisation. Experiments on 12 instances and four-month wafer-fab simulation demonstrate the approach’s superiority.

Authors

Institutions

Publication Details

Journal
Enterprise Information Systems
Published
2026-10-28
DOI
https://doi.org/10.1080/17517575.2026.2750209
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

A multi-population cooperative Jaya algorithm with adaptive rescheduling strategy for dynamic scheduling in semiconductor manufacturing system

Wenbin Xiang, Peng Zhang, Hongsen Li, Mengyu Jin et al.
Enterprise Information Systems
Scheduling and Optimization Algorithms
article

A multi-population cooperative Jaya algorithm with adaptive rescheduling strategy for dynamic scheduling in semiconductor manufacturing system

Wenbin Xiang, Peng Zhang, Hongsen Li, Mengyu Jin, Jie Zhang, Ming Wang
article en

Abstract

Time-window constraints (TWCs) and dynamic disruptions complicate semiconductor wafer fabrication scheduling. To address this issue, we present a rescheduling approach incorporating deep reinforcement learning and the multi-population Jaya algorithm (DRL-MPJA). An adaptive DRL-based rescheduling trigger handles uncertain events, and the DRL agent adaptively selects the optimal strategy by real-time states and rewards. For complete rescheduling, three sub-populations optimise makespan, schedule deviation, and TWC feasibility, forming a reference population and guiding sequence. GEPA provides unified evaluation, while GEPRG selects promising candidates based on similarity, enabling cooperative optimisation. Experiments on 12 instances and four-month wafer-fab simulation demonstrate the approach’s superiority.

Enterprise Information Systems
Donghua University (CN)
Openalex Percentile: Top 13%
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.

Laika access coming soon