Petri Net-based Scheduling of Time Constrained Single-arm Cluster Tools with Wafer Revisiting
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Mar 23, 2017
app pub date -
Oct 21, 2015
filing date -
Sep 20, 2015
priority date (Note) -
Published
status (Latency Note)
Importance
Abstract
It is very difficult to schedule a single-arm cluster tool with wafer revisiting such that wafer residency time constraints are satisfied. The present invention conducts a study on this challenging problem for a single-arm cluster tool with atomic layer deposition (ALD) process. With a so called p-backward strategy being applied, a Petri net model is developed to describe the dynamic behavior of the system. Based on the model, existence of a feasible schedule is analyzed, schedulability conditions are derived, and scheduling algorithms are presented if there is a schedule. A schedule is obtained by simply setting the robot waiting time if schedulable and it is very computationally efficient. The obtained schedule is shown to be optimal. Illustrative examples are given to demonstrate the proposed approach.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully