DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lee, Tae-Eog | - |
dc.contributor.advisor | 이태억 | - |
dc.contributor.author | Kim, Dae-Kyu | - |
dc.contributor.author | 김대규 | - |
dc.date.accessioned | 2015-04-23T06:33:36Z | - |
dc.date.available | 2015-04-23T06:33:36Z | - |
dc.date.issued | 2013 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=565523&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/196971 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 산업및시스템공학과, 2013.8, [ viii, 100 p. ] | - |
dc.description.abstract | Cluster tools, each of which consists of several single-wafer processing chambers, a wafer handling robot and loadlocks for wafer cassette loading, have been widely used for various wafer fabrication processes. Recently, they tend to be connected together or more chambers are serially configured in a tool with multiple robots in order to reduce lot transfers between tools and increase the tool throughput by parallelizing a long process step with multiple chambers. One of the objectives of this research is to provide a unified cyclic scheduling method for such sequentially connected tools. Another objective is to discuss optimal scheduling of transient cycles for cluster tools. Scheduling problems of transient cycles such as start-up cycles and close-down cycles have not been well addressed compared to those of steady full cycles in which cluster tools can repeat identical work cycles. However, the proportion of the transient cycles has become larger than before due to smaller lot size. For these problems, we use the concept of the workload, the minimal time to produce a wafer at the resource, and extend the workload to the problems for sequentially connected tools and transient cycles. In Chapter 2, we examine cyclic scheduling problems of sequentially connected cluster tools with separated input and output modules, which include linear cluster tools and in-line multiple cluster tools. We first compute workloads for each process step and each robot, of which the maximum provide a lower bound of the tool cycle time. We then identify an assignment rule of assigning the chambers to the process steps that makes the tool cycle time independent of the order of using the parallel chambers. We also propose robot task sequences for each component cluster tool, which are modified from the well-known backward sequence or swap sequence. We prove that the modified backward sequence and the swap sequence are optimal for single-armed component tools and dual-armed component... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Cluster tools | - |
dc.subject | 전이 작업 | - |
dc.subject | 순차적으로 연결된 | - |
dc.subject | 주기적 스케쥴링 | - |
dc.subject | 워크로드 | - |
dc.subject | 클러스터 장비 | - |
dc.subject | Workload | - |
dc.subject | Cyclic scheduling | - |
dc.subject | Sequentially connected | - |
dc.subject | Transient operation | - |
dc.title | Optimal Scheduling by Workload Analysis for Cluster Tools | - |
dc.title.alternative | 워크로드 분석에 의한 클러스터 장비의 최적 스케쥴링 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 565523/325007 | - |
dc.description.department | 한국과학기술원 : 산업및시스템공학과, | - |
dc.identifier.uid | 020095274 | - |
dc.contributor.localauthor | Lee, Tae-Eog | - |
dc.contributor.localauthor | 이태억 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.