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
- Wenbin Xiang (ORCID: https://orcid.org/0000-0002-7525-5150)
- Peng Zhang (ORCID: https://orcid.org/0000-0003-2613-910X)
- Hongsen Li
- Mengyu Jin
- Jie Zhang
- Ming Wang
Institutions
- Donghua University (CN)
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