Modeling and optimal cyclic scheduling of time-constrained single-robot-arm cluster tools via Petri nets and linear programming

• Main Authors: Yang, FaJun, Wu, NaiQi, Qiao, Yan, Zhou, MengChu, Su, Rong, Qu, Ting
• Other Authors: School of Electrical and Electronic Engineering
• Format: Article
• Language: English
• Published: 2020
• Subjects: Engineering::Electrical and electronic engineering; Cluster Tools; Cyclic Scheduling
• Online Access: https://hdl.handle.net/10356/139933
• Institution: Nanyang Technological University

Scheduling a cluster tool with wafer residency time constraints is challenging and important in wafer manufacturing. With a backward strategy, the scheduling problem of such singlerobot-arm cluster tools is well-studied in the literature. It is much more challenging to schedule a more general case whose optimal scheduling strategy is not limited to the backward one. This work uses a timed Petri net (PN) to model the dynamic behavior of the system and presents a method to determine the optimal scheduling strategy for the system. Based on its PN model and the obtained strategy, it reveals that the key issue to schedule such a tool is to determine when and how long the robot should wait for. Based on this finding, this work establishes for the first time the necessary and sufficient conditions regarding the existence of an optimal and feasible one-wafer cyclic schedule for singlerobot-arm cluster tools. It then formulates a computationally efficient linear program to find it if existing, and finally gives industrial examples to show the application and power of the proposed method.