Decentralized Genetic Algorithm-Based Online Rescheduling for Semiconductor Manufacturing Systems

For semiconductor manufacturing factories, the creation of a master schedule spanning several weeks is crucial for outlining the production timeline, including processing schedules and lot locations. However, the semiconductor assembly line operates within a dynamic environment that is subject to random disruptions, such as machine failures. These disruptions can lead to delays and time window violation, thereby rendering the master schedule suboptimal or even infeasible. This paper specifically addresses the impact of long machine failures, defined as those exceeding an hour, which significantly disrupt the assembly line’s operations. To confront this challenge, we propose a decentralized genetic algorithm tailored to adjust a short-term master schedule while accommodating re-entrant operations and adhering to time window constraints. Our experiments are conducted using real-world datasets, and the results illustrate that the proposed method effectively reduces delays and prevents time window violations within limited computational time.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automation Science and Engineering
Published
2025-08-08
DOI
https://doi.org/10.1109/tase.2025.3597006
Citations
1
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
1.24

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decentralized Genetic Algorithm-Based Online Rescheduling for Semiconductor Manufacturing Systems

Yutong Su, Feng Ju, Nital S. Patel, Husam Dauod et al.
1 citations
IEEE Transactions on Automation Science and Engineering
Scheduling and Optimization Algorithms
1.24
article

Decentralized Genetic Algorithm-Based Online Rescheduling for Semiconductor Manufacturing Systems

Yutong Su, Feng Ju, Nital S. Patel, Husam Dauod, Balakrishnan Ananthanarayanan
article en
1 citations

Abstract

For semiconductor manufacturing factories, the creation of a master schedule spanning several weeks is crucial for outlining the production timeline, including processing schedules and lot locations. However, the semiconductor assembly line operates within a dynamic environment that is subject to random disruptions, such as machine failures. These disruptions can lead to delays and time window violation, thereby rendering the master schedule suboptimal or even infeasible. This paper specifically addresses the impact of long machine failures, defined as those exceeding an hour, which significantly disrupt the assembly line’s operations. To confront this challenge, we propose a decentralized genetic algorithm tailored to adjust a short-term master schedule while accommodating re-entrant operations and adhering to time window constraints. Our experiments are conducted using real-world datasets, and the results illustrate that the proposed method effectively reduces delays and prevents time window violations within limited computational time.

IEEE Transactions on Automation Science and EngineeringVol. 23
Intel (United States) (US), Intel (India) (IN), Arizona State University (US)
Intel Corporation, Division of Civil, Mechanical and Manufacturing Innovation
Openalex Percentile: Top 16%
Scheduling and Optimization Algorithms
1.24
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.