Content area

Abstract

With the requirements of physical vapor deposition and chemical vapor deposition processes, twin-cluster tools are widely used in the current wafer fabrication. Cycle scheduling ensures that wafers have the same quality, however, twin-cluster tools involve resource coordination between two tools, which makes cycle scheduling more sophisticated. A steady-state cycle scheduling problem of twin-cluster tools with a complete concurrent processing module is studied, considering the wafer residency time constraints. First, a Petri net model is constructed to describe the process of twin-cluster tools under a steady state with the wafer residency time constraints and the complete concurrent processing module, and a control strategy is proposed to avoid the system deadlock. The sufficient conditions for the system to reach the highest efficiency are obtained by analyzing the workload of the processing module and the robot task, and an algorithm is developed to obtain the robot schedule. Finally, examples are verified about the effectiveness of the algorithms.

Details

1009240
Title
Scheduling twin-cluster tools for complete concurrent processing with wafer residence time constraints
Author
Zhou, Hao 1 ; Pan, Chunrong 1 

 School of Mechanical and Electrical Engineering, Jiangxi University of Science and Technology , Ganzhou, Jiangxi, 341000, China 
Publication title
Volume
2803
Issue
1
First page
012059
Publication year
2024
Publication date
Jul 2024
Publisher
IOP Publishing
Place of publication
Bristol
Country of publication
United Kingdom
Publication subject
ISSN
17426588
e-ISSN
17426596
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
ProQuest document ID
3087329985
Document URL
https://www.proquest.com/scholarly-journals/scheduling-twin-cluster-tools-complete-concurrent/docview/3087329985/se-2?accountid=208611
Copyright
Published under licence by IOP Publishing Ltd. This work is published under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2024-08-02
Database
ProQuest One Academic