Abstract
It is a great challenge to find an optimal one-wafer cyclic schedule for a single-arm multi-cluster tool that is widely adopted in semiconductor fabrication. Aiming to tackle this significant problem, an optimal scheduling strategy is determined first for each individual tool under the condition that the bottleneck individual tool is transport-bound. Then, by developing a Petri net model with robot waiting being explicitly described to reveal the properties of the entire system, this paper shows that to schedule such a tool optimally is to allocate the robot waiting time properly. Then, this paper presents the necessary and sufficient conditions for the existence of an optimal one-wafer cyclic schedule. Thereafter, an efficient algorithm is developed to check the given conditions and find such a schedule efficiently if existing. Finally, two industrial examples are used to verify that the proposed method is applicable and effective.
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.
