An optimal scheduling technique for dual-arm robots in cluster tools with residency constraints

TitleAn optimal scheduling technique for dual-arm robots in cluster tools with residency constraints
Publication TypeConference Paper
Year of Publication2000
AuthorsRostami, S., B. Hamidzadeh, and D. Camporese
Conference NameDecision and Control, 2000. Proceedings of the 39th IEEE Conference on
Pagination3459 -3464 vol.4
Keywordscluster tools, computational complexity, dual-arm robots, feasible schedule, industrial robots, manufacturing processes, material unit, maximum throughput, optimal scheduling technique, processing module, production control, residency constraints, search problems, throughput requirements
Abstract

Discusses a scheduling technique, for cluster tools, that addresses post-processing residency constraints and throughput requirements. The residency constraints impose a limit on the post-processing time that a material unit spends in a processing module. The technique searches in the time and resource domains for a feasible schedule with a maximum throughput. Several heuristics are designed and added to reduce the complexity of the scheduling algorithm. The resulting schedules are deadlock free, since resources are scheduled according to the times that they are available. Analytical and experimental analyses demonstrate the correctness and efficiency of our proposed technique

URLhttp://dx.doi.org/10.1109/CDC.2000.912239
DOI10.1109/CDC.2000.912239

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