{"title":"Buffer space configuration and scheduling analysis of single-arm multi-cluster tools","authors":"Liping Bai, N. Wu, Zhiwu Li, Mengchu Zhou","doi":"10.1109/WODES.2016.7497871","DOIUrl":null,"url":null,"abstract":"This work studies the buffer space configuration problem to obtain an optimal one-wafer cyclic schedule for single-arm multi-cluster tools with a linear topology. To do so, a Petri net model is developed to describe the dynamic behavior of the system by extending the resource-oriented Petri nets such that a schedule can be parameterized with robots' waiting time. Based on this model, conditions for the existence of a one-wafer cyclic schedule with the lower bound of cycle time are presented, and algorithm is developed to find such an optimal schedule. The algorithm requires only simple calculation to set the robots' waiting time and configure the buffer spaces between two individual tools. An example is presented to show the application and power of the proposed method.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","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.7497871","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This work studies the buffer space configuration problem to obtain an optimal one-wafer cyclic schedule for single-arm multi-cluster tools with a linear topology. To do so, a Petri net model is developed to describe the dynamic behavior of the system by extending the resource-oriented Petri nets such that a schedule can be parameterized with robots' waiting time. Based on this model, conditions for the existence of a one-wafer cyclic schedule with the lower bound of cycle time are presented, and algorithm is developed to find such an optimal schedule. The algorithm requires only simple calculation to set the robots' waiting time and configure the buffer spaces between two individual tools. An example is presented to show the application and power of the proposed method.