Paper Info
Title
An Optimal Periodic Scheduler For Dual-Arm Robots In Cluster Tools With Residency Constraints
Abstract
This paper discusses a scheduling technique, for cluster tools, that addresses postprocessing residency constraints and throughput requirements. The residency constraints impose a limit on the postprocessing 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. It operates in two main phases; the initial one of which (and the lower complexity one) computes a simple periodic schedule. For a large number of problem instances, the simple periodic schedule feasibly solves the problem. If a feasible schedule cannot be found in the first phase, the scheduler enters phase two (the higher complexity one) to compute a feasible schedule. During this phase, the scheduler incrementally increases the period only if necessary, to keep the throughput at a maximum. 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 analyzes demonstrate the correctness and efficiency of our proposed technique.
Year
DOI
Venue
2001
10.1109/70.964662
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION
Keywords
Field
DocType
cluster tool, residency constraint, robotics, scheduling, semiconductor manufacturing
Fixed-priority pre-emptive scheduling,Mathematical optimization,Production control,Control theory,Scheduling (computing),Computer science,Correctness,Real-time computing,Heuristics,Schedule,Throughput,Computational complexity theory
Journal
Volume
Issue
ISSN
17
5
1042-296X
Citations 
PageRank 
References 
48
2.68
2
Authors
3
Name
Order
Citations
PageRank
Shadi Rostami1483.02
Hamidzadeh Babak218424.99
Daniel Camporese3513.67