DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lee, Tae-Eog | - |
dc.contributor.advisor | 이태억 | - |
dc.contributor.author | Paek, Jin-Heum | - |
dc.contributor.author | 백진흠 | - |
dc.date.accessioned | 2011-12-14T02:40:59Z | - |
dc.date.available | 2011-12-14T02:40:59Z | - |
dc.date.issued | 2008 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=303568&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40630 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 산업공학과, 2008. 8., [ ix, 106 p. ] | - |
dc.description.abstract | In a dual-armed cluster tool, the swap operation method that exchange a wafer on a robot arm with another wafer at a chamber has been mostly used. It is known to minimize the tool cycle time although it restricts the robot task sequence. Recent cluster tools have new scheduling requirements such as reentrant wafer flows for atomic layer deposition processes, constraints on the wafer delay times within chambers after processing, and concurrent processing of different wafer types. The restricted swap operation method may neither minimize the tool cycle time nor satisfy the wafer delay constraints, and even cause a deadlock. We examine new robot task sequences for dual-armed cluster tools that use the two robot arms more flexibly than the conventional restricted swap operation method. In this thesis, we first examine new robot task sequences for a dual-armed cluster tool with basic scheduling requirements. We develop a systematic method of modeling the tool operational behaviors for non-swap operation sequences by using Petri nets. By examining the net model, we show that if the routing decisions on a conflict place of the model are made in cyclic order, the net is behaviorally equivalent to an event graph. We also identify conditions to prevent deadlocks to enhance computation time. From the results, we develop a mixed integer programming model for determining the optimal tool operation sequence, schedule, and cycle time. Finally, we discuss how our works can be applied to each of the additional scheduling requirements such as residency time constraints and concurrent wafer flows. Second, we address modeling and scheduling issues for dual-armed cluster tools with reentrant job flows. There have been some researches addressing the issues, however, it is not yet clearly determined or investigated how the dual-armed robot can be fully utilized with the flow. To do this, we first propose a systematic way of modeling the tool operational behaviors with ree... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | cluster tool | - |
dc.subject | robot task | - |
dc.subject | scheduling | - |
dc.subject | petri net | - |
dc.subject | MIP model | - |
dc.subject | 클러스터 툴 | - |
dc.subject | 로봇 작업 | - |
dc.subject | 일정계획 | - |
dc.subject | 페트리 넷 | - |
dc.subject | 정수계획 모델 | - |
dc.subject | cluster tool | - |
dc.subject | robot task | - |
dc.subject | scheduling | - |
dc.subject | petri net | - |
dc.subject | MIP model | - |
dc.subject | 클러스터 툴 | - |
dc.subject | 로봇 작업 | - |
dc.subject | 일정계획 | - |
dc.subject | 페트리 넷 | - |
dc.subject | 정수계획 모델 | - |
dc.title | Optimal scheduling of dual-armed cluster tools with complex scheduling requirements by general robot task sequences | - |
dc.title.alternative | 일반적인 로봇 작업 순서를 고려한 복잡한 스케줄링 요구사항을 갖는 양팔 클러스터 장비의 최적 스케줄링에 관한 연구 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 303568/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 020025135 | - |
dc.contributor.localauthor | Lee, Tae-Eog | - |
dc.contributor.localauthor | 이태억 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.