{"title":"Scheduling of time constrained dual-arm cluster tools with wafer revisiting","authors":"Yan Qiao, N. Wu, Mengchu Zhou","doi":"10.1109/CoASE.2013.6653916","DOIUrl":null,"url":null,"abstract":"This work intends to schedule a dual-arm cluster tool for the atomic layer deposition (ALD) process with wafer residency time constraints. ALD is a typical wafer revisiting process. Based on the analysis of system properties, a novel scheduling strategy called modified 1-wafer cyclic scheduling is derived. With this strategy, necessary and sufficient schedulability conditions are established. If schedulable, scheduling algorithms are presented to obtain a feasible and optimal schedule. By the proposed method, a schedule can be found by just simple calculation. An illustrative example is given to show the application of the proposed approach.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CoASE.2013.6653916","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
This work intends to schedule a dual-arm cluster tool for the atomic layer deposition (ALD) process with wafer residency time constraints. ALD is a typical wafer revisiting process. Based on the analysis of system properties, a novel scheduling strategy called modified 1-wafer cyclic scheduling is derived. With this strategy, necessary and sufficient schedulability conditions are established. If schedulable, scheduling algorithms are presented to obtain a feasible and optimal schedule. By the proposed method, a schedule can be found by just simple calculation. An illustrative example is given to show the application of the proposed approach.