Optimal scheduling techniques for cluster tools with process-module and transport-module residency constraints

TitleOptimal scheduling techniques for cluster tools with process-module and transport-module residency constraints
Publication TypeConference Paper
Year of Publication2001
AuthorsRostami, S., and B. Hamidzadeh
Conference NameRobotics and Automation, 2001. Proceedings 2001 ICRA. IEEE International Conference on
Pagination3326 - 3331 vol.4
Keywordscluster tools, complexity, computational complexity, dual-arm cluster tools, heuristics, linear programming, manufacturing processes, process-module, production control, scheduling, transport-module
Abstract

This paper discusses two scheduling techniques for dual-arm cluster tools that address both process module and transport-module residency constraints and throughput requirements. The first technique is an extension of our previous work (2000) that only addressed process-module residency constraints. For cases with long process times, this technique can take a long time to find the solution and is not practical. Hence, we use this algorithm mainly as a benchmark for comparison. The second technique that uses a linear programming method with several heuristics can find the optimal solution very efficiently. An analytical and experimental analysis of this technique shows the correctness, completeness and efficiency of this technique.

URLhttp://dx.doi.org/10.1109/ROBOT.2001.933131
DOI10.1109/ROBOT.2001.933131

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia