Abstract
In semiconductor manufacturing, finding an efficient way for scheduling a multicluster tool is critical for productivity improvement and cost reduction. This two-part paper analyzes optimal scheduling of multicluster tools equipped with single-blade robots and constant robot moving times. In this first part of the paper, a resource-based method is proposed to analytically derive closed-form expressions for the minimal cycle time of two-cluster tools. We prove that the optimal robot scheduling of two-cluster tools can be solved in polynomial time. We also provide an algorithm to find the optimal schedule. Examples are presented to illustrate the proposed approaches and formulations.
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 callMore From: IEEE Transactions on Automation Science and Engineering
Disclaimer: 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.
