Abstract
In a multi-cluster tool, there may be both single and dual-arm cluster tools. Such a multi-cluster tool is called hybrid multi-cluster tool. To operate such a multi-cluster tool, one needs to coordinate different types of robots for accessing the shared buffering modules. Aiming at finding a one-wafer periodic schedule such that the lower bound of cycle time can be reached, this paper conducts a study on scheduling a hybrid multi-cluster tool with its bottleneck tool being process-bound. The tool is modeled by a kind of timed Petri net model. With this model, the scheduling problem is reduced to determining the robots' waiting time. Then, the conditions under which a one-wafer periodic schedule exists such that the lower bound of cycle time can be reached are presented. Based on them, a closed-form algorithm is given to check whether such a one-wafer periodic schedule exists. If so, it is found via simple calculation. Examples are given to show the application of the proposed method. © 1988-2012 IEEE.
Author supplied keywords
Cite
CITATION STYLE
Yang, F., Wu, N., Qiao, Y., & Zhou, M. (2014). Petri net-based optimal one-wafer cyclic scheduling of hybrid multi-cluster tools in wafer fabrication. IEEE Transactions on Semiconductor Manufacturing, 27(2), 192–203. https://doi.org/10.1109/TSM.2014.2312192
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.