Home / Journals / CMES / Online First / doi:10.32604/cmes.2026.076245
Special Issues
Table of Content

Open Access

ARTICLE

Modeling and Optimization of Diffusion Process Scheduling under Strict Queue Time Constraints in Semiconductor Manufacturing

Liangchao Chen1, Yan Qiao1,*, Siwei Zhang1,*, Bin Liu2, Yonghua Shao3, Sijun Zhan3
1 Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and Systems, Macau University of Science and Technology, Taipa, Macao, China
2 IKAS Holdings (Beijing) Co., Ltd., Beijing, China
3 AscenPower Semiconductors Co., Ltd., Guangzhou, China
* Corresponding Author: Yan Qiao. Email: email; Siwei Zhang. Email: email
(This article belongs to the Special Issue: Swarm and Metaheuristic Optimization for Applied Engineering Application)

Computer Modeling in Engineering & Sciences https://doi.org/10.32604/cmes.2026.076245

Received 17 November 2025; Accepted 06 March 2026; Published online 07 April 2026

Abstract

This article examines wafer lots scheduling in the diffusion area in semiconductor manufacturing. The diffusion area comprises multiple tool groups. Each of them contains non-identical semiconductor tools. All tools can process multiple wafer lots simultaneously, and wafer lots processed together in a tool are called a wafer batch. Besides, each wafer lot has specific queue time limits (QTLs) between consecutive processing operations, making the scheduling problem more complicated. To solve it, a discrete backtracking search optimization algorithm (DBSA) is designed for optimizing both wafer lot assignments and wafer batch processing sequences. Once the processing sequence of wafer batches at each tool is determined, a linear program (LP) is built to obtain optimal starting and completion time points of wafer batches while satisfying QTLs. If a schedule is examined to have no feasible solution by the LP, a proposed approach is used to regroup wafer lots to form wafer batches and adjust their processing sequences to potentially make it feasible. Extensive experiments show that DBSA reliably produces feasible schedules and outperforms GA, MixPSO, and GWO, with up to 17.75%, 19.19%, and 9.21% reductions in average cycle time, respectively, demonstrating its superiority in both solution quality and practical applicability.

Keywords

Metaheuristic algorithms; queue time limits; scheduling; semiconductor manufacturing
  • 67

    View

  • 16

    Download

  • 1

    Like

Share Link