The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 11, 2018

Filed:

Oct. 21, 2015
Applicant:

Macau University of Science and Technology, Macau, MO;

Inventors:

Naiqi Wu, Macau, MO;

Fajun Yang, Macau, MO;

Yan Qiao, Macau, MO;

Mengchu Zhou, Macau, MO;

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G05B 19/41 (2006.01); G05B 19/418 (2006.01);
U.S. Cl.
CPC ...
G05B 19/4187 (2013.01); G05B 2219/31429 (2013.01); G05B 2219/45032 (2013.01); Y02P 90/205 (2015.11); Y10S 901/02 (2013.01); Y10S 901/41 (2013.01);
Abstract

Since single and dual-arm tools behave differently, it is difficult to coordinate their activities in a hybrid multi-cluster tool that is composed of both single- and dual-arm tools. Aiming at finding an optimal one-wafer cyclic schedule for a treelike hybrid multi-cluster tool whose bottleneck tool is process-bound, the present work extends a resource-oriented Petri net to model such system. By the developed Petri net model, to find a one-wafer cyclic schedule is to determine robot waiting times. By doing so, it is shown that, for any treelike hybrid multi-cluster tool whose bottleneck tool is process-bound, there is always a one-wafer cyclic schedule. Then, computationally efficient algorithms are developed to obtain the minimal cycle time and the optimal one-wafer cyclic schedule. Examples are given to illustrate the developed method.


Find Patent Forward Citations

Loading…