{"title":"Optimal scheduling of time-constrained single-arm cluster tools with wafer revisiting","authors":"Zicheng Liu, N. Wu, Fajun Yang, Yan Qiao","doi":"10.1109/WODES.2016.7497872","DOIUrl":null,"url":null,"abstract":"It is very difficult to schedule a single-arm cluster tool with wafer revisiting such that wafer residency time constraints are satisfied. This paper conducts a study on this challenging problem for a single-arm cluster tool with atomic layer deposition (ALD) process. With a so called p-backward strategy being applied, a Petri net model is developed to describe the dynamic behavior of the system. Based on the model, existence of a feasible schedule is analyzed, schedulability conditions are derived, and a scheduling algorithm is presented if there is a schedule. A schedule is obtained by simply setting the robot waiting time and it is very computationally efficient. The obtained schedule is shown to be optimal. Illustrative examples are given to demonstrate the proposed approach.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 13th International Workshop on Discrete Event Systems (WODES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2016.7497872","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
It is very difficult to schedule a single-arm cluster tool with wafer revisiting such that wafer residency time constraints are satisfied. This paper conducts a study on this challenging problem for a single-arm cluster tool with atomic layer deposition (ALD) process. With a so called p-backward strategy being applied, a Petri net model is developed to describe the dynamic behavior of the system. Based on the model, existence of a feasible schedule is analyzed, schedulability conditions are derived, and a scheduling algorithm is presented if there is a schedule. A schedule is obtained by simply setting the robot waiting time and it is very computationally efficient. The obtained schedule is shown to be optimal. Illustrative examples are given to demonstrate the proposed approach.