2020
DOI: 10.1109/jas.2020.1003150
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling dual-arm cluster tools with multiple wafer types and residency time constraints

Abstract: Scheduling dual-arm cluster tools with multiple wafer types and residency time constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 29 publications
(4 citation statements)
references
References 53 publications
0
4
0
Order By: Relevance
“…For example, in order to meet the wafer residency time constraints, Qiao et al [21] propose PM failure response policies which can successfully transfer a cluster tools to the feasible schedule after failure from the one before a failure, and develops efficient algorithms to improve these response policies which are composed of simple control laws. Wang et al [22] investigate the scheduling problems of dual-arm cluster tools with multiple wafer types and residency time constraints, and develops a novel robot activity strategy called multiplex swap sequence so as to pursue an easy-to-implement cyclic operation under diverse flow patterns. Yang et al [23] study the challenging problem for scheduling a single-arm cluster tool with wafer residency time constraints and uses a timed Petri net to model the dynamic behavior of the system and presents a method to determine the optimal scheduling strategy for the system, and reveals that the key issue to schedule such a tool is to determine when and how long the robot should wait for.…”
Section: ) Scheduling Analysis and Optimizing Of Cluster Toolsmentioning
confidence: 99%
“…For example, in order to meet the wafer residency time constraints, Qiao et al [21] propose PM failure response policies which can successfully transfer a cluster tools to the feasible schedule after failure from the one before a failure, and develops efficient algorithms to improve these response policies which are composed of simple control laws. Wang et al [22] investigate the scheduling problems of dual-arm cluster tools with multiple wafer types and residency time constraints, and develops a novel robot activity strategy called multiplex swap sequence so as to pursue an easy-to-implement cyclic operation under diverse flow patterns. Yang et al [23] study the challenging problem for scheduling a single-arm cluster tool with wafer residency time constraints and uses a timed Petri net to model the dynamic behavior of the system and presents a method to determine the optimal scheduling strategy for the system, and reveals that the key issue to schedule such a tool is to determine when and how long the robot should wait for.…”
Section: ) Scheduling Analysis and Optimizing Of Cluster Toolsmentioning
confidence: 99%
“…If R > m i (10) x g+h×n i = 1; (11) R = max(R−1, 0); (12) For f = 1 to q (13) If (g + h×n i − f )/q is a non-negative integer (14) x f = 1; (15) x f = x f ; (16) Perform one of Algorithms 1 and 2 for Step s; (17) If…”
Section: Formentioning
confidence: 99%
“…By considering processing time variation, an adaptive scheduling method is presented for cluster tools with wafer delay constraints in [11]. With WRTCs and multiple wafer types being processed, efficient scheduling approaches are proposed for SACTs in [12] and DACTs in [13,14].…”
Section: Introductionmentioning
confidence: 99%
“…multiple wafer types [40]- [44]. For the DACT, Kim et al [45] prove that the latest=earliest starting policy can minimize its start-up=close-down transient process (SUTP and CDTP for short), respectively.…”
Section: Stepmentioning
confidence: 99%