Optimal One-Wafer Cyclic Scheduling of Hybrid Multirobot Cluster Tools With Tree Topology

摘要

A hybrid multirobot cluster tool is composed of both single and dual-arm robotic cluster tools. Since the behavior of different individual tools is different, it is very challenging to coordinate their activities in such a tool and to schedule it optimally. To find a one-wafer cyclic schedule to reach the shortest cycle time for a treelike hybrid multirobot cluster tool whose bottleneck tool is process-bound, this paper extends resource-oriented Petri nets to model it such that a schedule can be parameterized by its robots' waiting time. Based on the model, this paper then establishes the conditions under which there is a one-wafer cyclic schedule such that the shortest cycle time can be obtained. An efficient algorithm is also given to test the existence of such a schedule and to find it if existing. At last, examples are used to illustrate the proposed approaches.