Optimal One-Wafer Cyclic Scheduling of Single-Arm Multicluster Tools With Two-Space Buffering Modules

被引:28
作者
Yang, FaJun [1 ]
Wu, NaiQi [2 ,3 ]
Qiao, Yan [1 ]
Zhou, MengChu [4 ,5 ]
机构
[1] Guangdong Univ Technol, Sch Electromech Engn, Dept Ind Engn, Guangzhou 510006, Guangdong, Peoples R China
[2] Macau Univ Sci & Technol, Inst Syst Engn, Macau 999078, Peoples R China
[3] Guangdong Univ Technol, Dept Ind Engn, Guangzhou 510006, Guangdong, Peoples R China
[4] Tongji Univ, Minist Educ, Key Lab Embedded Syst & Serv Comp, Shanghai 201804, Peoples R China
[5] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
来源
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS | 2014年 / 44卷 / 12期
基金
中国国家自然科学基金;
关键词
Multi-cluster tools; Petri net (PN); scheduling; semiconductor manufacturing; CRUDE-OIL OPERATIONS; LIVENESS-ENFORCING SUPERVISORS; RESIDENCY TIME CONSTRAINTS; DEADLOCK PREVENTION POLICY; ORIENTED PETRI-NET; CLUSTER TOOLS; MANUFACTURING SYSTEMS; SCHEDULABILITY ANALYSIS; EVENT GRAPH; AVOIDANCE;
D O I
10.1109/TSMC.2014.2327051
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A multi-cluster tool is composed of a number of individual cluster tools linked by buffering modules (BMs). The capacity of a BM can be one or two. Aiming at finding an optimal one-wafer cyclic schedule, this paper explores the effect of two-space BMs on the performance of a multi-cluster tool. A Petri net (PN) model is developed to model it by extending resource-oriented PNs. The dynamic behavior of robot waiting and tasks, process modules, and buffers is well described by the model. This paper shows that there is always a one-wafer cyclic schedule that reaches the lower bound of the cycle time of a process-bound tool. Furthermore, a closed-form algorithm is revealed to find such a schedule for the first time for such multi-cluster tools. Illustrative examples are given to show the application and power of the proposed method.
引用
收藏
页码:1584 / 1597
页数:14
相关论文
共 65 条
[1]  
BADER ME, 1990, SOLID STATE TECHNOL, V33, P149
[2]  
Burggraaf P., 1995, Semiconductor International, V18, P45
[3]   Optimal Scheduling of Multicluster Tools With Constant Robot Moving Times, Part I: Two-Cluster Analysis [J].
Chan, Wai Kin Victor ;
Yi, Jingang ;
Ding, Shengwei .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2011, 8 (01) :5-16
[4]   Optimal Scheduling of Multicluster Tools With Constant Robot Moving Times, Part II: Tree-Like Topology Configurations [J].
Chan, Wai Kin Victor ;
Ding, Shengwei ;
Yi, Jingang ;
Song, Dezhen .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2011, 8 (01) :17-28
[5]  
Chan WK, 2008, IEEE INT CON AUTO SC, P335
[6]   Multicluster tools scheduling: An integrated event graph and network model approach [J].
Ding, Shengwei ;
Yi, Jingang ;
Zhang, Mike Tao .
IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 2006, 19 (03) :339-351
[7]   Comparing digraph and Petri net approaches to deadlock avoidance in FMS [J].
Fanti, MP ;
Maione, B ;
Turchiano, B .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2000, 30 (05) :783-798
[8]   Deadlock control methods in automated manufacturing systems [J].
Fanti, MP ;
Zhou, MC .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2004, 34 (01) :5-22
[9]  
Jevtic D., 2001, U.S. Patent, Patent No. [6 224 638, 6224638]
[10]  
Jevtic D., 2001, Eur. Patent, Patent No. [1 132 792 A2, 1132792]