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:
Jan. 05, 2016

Filed:

Mar. 05, 2015
Applicant:

Macau University of Science and Technology, Macau, MO;

Inventors:

Liping Bai, Mo, MO;

Naiqi Wu, Mo, MO;

Zhiwu Li, Mo, MO;

Mengchu Zhou, Newark, NJ (US);

Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 19/00 (2011.01); B25J 9/00 (2006.01); G05B 19/418 (2006.01); G06F 17/50 (2006.01);
U.S. Cl.
CPC ...
B25J 9/009 (2013.01); G05B 19/41865 (2013.01); G06F 17/5013 (2013.01); G05B 2219/45032 (2013.01); Y10S 901/02 (2013.01); Y10S 901/41 (2013.01);
Abstract

A method for scheduling single-arm multi-cluster tools is provided. The present invention studies the scheduling problem of a single-arm multi-cluster tool with a linear topology and process-bound bottleneck individual tool. Its objective is to find a one-wafer cyclic schedule such that the lower bound of cycle time is reached by optimally configuring spaces in buffering modules that link individual cluster tools. A Petri net model is developed to describe the dynamic behavior of the system by extending resource-oriented Petri nets such that a schedule can be parameterized by robots' waiting time. Based on this model, conditions are presented under which a one-wafer cyclic schedule with lower bound of cycle time can be found. With the derived conditions, an algorithm is presented to find such a schedule and optimally configure the buffer spaces.


Find Patent Forward Citations

Loading…