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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
