Optimal One-Wafer Cyclic Scheduling and Buffer Space Configuration for Single-Arm Multicluster Tools With Linear Topology
针对线性拓扑单臂多簇工具，提出一种Petri网模型和算法，通过优化缓冲模块空间配置，实现周期时间下限的单片循环调度，仅需简单计算即可设定机器人等待时间和缓冲大小。
This work studies the scheduling problem of a single-arm multicluster tool with a linear topology and process-bound bottleneck individual tool. The objective is to find a one-wafer cyclic schedule such that the lower bound of cycle time is reached by optimally configuring spaces in buffering modules that link individual cluster tools. A Petri net (PN) model is developed to describe the dynamic behavior of the system by extending resource-oriented PNs such that a schedule can be parameterized by robots' waiting time. Based on this model, conditions are presented under which a one-wafer cyclic schedule with the lower bound of cycle time can be found. With the derived conditions, an algorithm is developed to find such a schedule and optimally configure buffer spaces. The algorithm requires only simple calculation to set the robots' waiting time and buffer size. Illustrative examples are presented to demonstrate the proposed method.