Cluster Tool Scheduling with Chamber Cleaning: Partial Loading in-between Process Steps
- Abstract
- A number of research has been conducted for exploring the optimal scheduling for the dual-armed cluster tools in the semiconductor manufacturing industry. Unlike the serial parallel configuration, determining the scheduling for a serial cluster tool is more challenging due to the absence of the parallel chambers, especially when the cleaning operation is introduced. In spite of swap(a,z) and backward(z) sequences are well-known for their optimal performance on various instances of serial parallel dual-armed cluster tool configuration with the cleaning operation, these two extended conventional sequences still have some optimality gap when dealing with the serial dual-armed cluster tools. Even their optimal performance declines when handling the lengthy process steps of the tool. Therefore, this research examines such scheduling problems with the objective of introducing MRT sequence which stands for maximize the minimum number of robot operation during chamber activity time.
The first main characteristic of MRT sequence is to maximize the minimum number of robot operation during chamber activity time between the unloading and loading of each step. In addition, MRT sequence is able to implement the partial loading strategy for a serial dual-armed cluster tool. The procedure of the proposed MRT sequence is also uncomplicated for the practical implementation. Overall, MRT sequence becomes a complementary sequence to the existing sequences for both serial and serial parallel dual-armed cluster tools. |반도체 제조 산업에서 dual-armed cluster tools에 대한 최적의 스케줄링을 탐구하기 위해 많은 연구가 수행되었습니다. 직렬 및 병렬 구성과 달리, 특히 cleaning operation이 도입될 때 병렬 챔버가 없기 때문에 serial cluster tool의 스케줄링을 결정하는 것이 더 어렵습니다. swap(a,z) 및 backward(z) 시퀀스는 클리닝 작업을 통해 직렬 및 병렬의 dual-armed cluster tools구성의 다양한 인스턴스에서 최적의 성능을 발휘하는 것으로 잘 알려져 있지만, 이 두 확장된 기존 시퀀스는 직렬 dual-armed cluster tools를 처리할 때 여전히 약간의 최적성 격차가 있습니다. 심지어 툴의 긴 프로세스 단계를 처리할 때에도 최적의 성능이 저하됩니다. 따라서 이 연구는 최대 로봇 개입 시간(maximize the minimum number of Robot operation during chamber activity Time) 시퀀스를 나타내는 MRT 시퀀스를 도입하는 것을 목표로 이러한 스케줄링 문제를 검토합니다.
MRT 시퀀스의 첫 번째 주요 기능은 챔버 활동 시간 동안 로봇 작동의 최소 수를 최대화하는 것입니다. 또한 MRT 시퀀스는 serial dual-armed cluster tools에 대한 partial loading 전략을 구현할 수 있습니다. 제안된 MRT 시퀀스의 절차의 실제 구현도 복잡하지 않습니다. 전반적으로, MRT 시퀀스는 직렬과 직렬 및 병렬의 dual-armed cluster tools 모두에 대한 기존 시퀀스의 보완 시퀀스가 됩니다.
- Author(s)
- NICHOLAS
- Issued Date
- 2023
- Awarded Date
- 2023-08
- Type
- Dissertation
- Keyword
- Scheduling, semiconductor manufacturing, dual-armed cluster tools, cleaning operation, Petri Net, MRT sequence, 스케줄링, 반도체 제조, 듀얼 암 클러스터 도구, 퍼지 작업, Petri Net, MRT 시퀀스
- Publisher
- 부경대학교
- URI
- https://repository.pknu.ac.kr:8443/handle/2021.oak/33475
http://pknu.dcollection.net/common/orgView/200000691361
- Affiliation
- Pukyong National University, Graduate school
- Department
- 산업 및 데이터공학과(산업데이터공학융합전공)
- Advisor
- 유태선
- Table Of Contents
- Chapter 1. Introduction 1
1.1 Background 1
1.2 Purpose of research 9
1.3 Content and scope of research 10
Chapter 2. Literature Reviews 12
2.1. Workload Analysis 12
2.2. Existing Schedule Rule (Sequence) 16
2.3. Timed Event Graph (TEG) Modelling 19
Chapter 3. Research Method 21
Chapter 4. Research Result and Analysis 23
4.1. MRT Sequence 23
4.2. Procedure of MRT Sequence for the Robot 24
4.3. Timed Event Graph (TEG) Modeling for MRT Sequence 26
4.3.1. Activity Place 27
4.4. Circuit Ratio 37
4.5. Comparison of MRT Sequence to The Optimal Solution 45
Chapter 5. Conclusion 53
References 55
- Degree
- Master
-
Appears in Collections:
- 대학원 > 산업및데이터공학과
- Authorize & License
-
- Authorize공개
- Embargo2024-09-30
- Files in This Item:
-
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.