A Closed-Form Solution for Schedulability and Optimal Scheduling of Dual-Arm Cluster Tools With Wafer Residency Time Constraint Based on Steady Schedule Analysis

Abstract

Because of wafer residency time constraints for cluster tools, it is very difficult to schedule them. This paper addresses their scheduling issues and conducts their schedulability and scheduling analysis. A Petri net (PN) model is developed to model them. With this model, to schedule a dual-arm cluster tool with wafer residency time constraints is to determine when and how long the robot should wait for. Based on the model, necessary and sufficient conditions under which the system is schedulable are presented. The conditions can be checked analytically. Meanwhile, an algorithm is developed for the optimal scheduling of dual-arm cluster tools. The algorithm finds an optimal periodic schedule with closed form expressions if it is schedulable. A method is also presented for the implementation of the obtained cyclic schedule by appropriately controlling the initial transient process. Examples are presented to show the application and power of the theory and algorithm.