AN EFFECTIVE SCHEDULING METHOD TO SINGLE-ARM CLUSTER TOOLS FOR PROCESSING MULTIPLE WAFER TYPES

被引:4
作者
Lu, Yanjun [1 ,2 ,3 ]
LI, Jie [2 ,3 ]
Qiao, Yan [2 ,3 ]
LI, Zhiwu [2 ,3 ]
Wu, Naiqi [2 ,3 ]
Pan, Chunrong [4 ]
机构
[1] JiangSu Open Univ, Sch Informat Technol, Nanjing 210000, Peoples R China
[2] Macau Univ Sci & Technol, Inst Syst Engn, Macau 999078, Peoples R China
[3] Macau Univ Sci & Technol, Collaborat Lab Intelligent Sci & Syst, Macau 999078, Peoples R China
[4] JiangXi Univ Sci & Technol, Sch Mech & Elect Engn, Ganzhou 341000, Peoples R China
基金
中国国家自然科学基金;
关键词
Cluster tool; scheduling; semiconductor manufacturing; particle swarm optimization; PETRI NETS; SCHEDULABILITY; OPTIMIZATION; ALGORITHM; SYSTEMS; SWARM; TESTS;
D O I
10.3934/jimo.2022137
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Recently, in semiconductor manufacturing, cluster tools have to process multiple wafer types concurrently due to product customization. Dif-ferent wafer types may have different processing routes, which causes deadlocks and complicates the scheduling problem of cluster tools. This work aims to de-velop a general method to resolve the scheduling problem of single-arm cluster tools with a general mix of wafer types. To this end, a generic Petri net model controlled by self-loops is developed to optimally avoid deadlocks. Based on the Petri net model, an earliest starting strategy is adopted to operate single-arm cluster tools once wafers enter the tools. In order to maximize the productiv-ity, a particle swarm optimization algorithm is constructed to determine the releasing sequence of raw wafers. Numerical examples are provided to validate the effectiveness and efficiency of the proposed method.
引用
收藏
页码:4450 / 4480
页数:31
相关论文
共 59 条
  • [41] Scheduling Cluster Tools in Semiconductor Manufacturing: Recent Advances and Challenges
    Pan, ChunRong
    Zhou, MengChu
    Qiao, Yan
    Wu, NaiQi
    [J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2018, 15 (02) : 586 - 601
  • [42] Data-driven approach to optimal control of ACC systems and layout design in large rooms with thermal comfort consideration by using PSO
    Qiao, Yan
    Zhang, SiWei
    Wu, NaiQi
    Wang, Xu
    Li, ZhiWu
    Zhou, MengChu
    Qu, Ting
    [J]. JOURNAL OF CLEANER PRODUCTION, 2019, 236
  • [43] Scheduling and Control of Startup Process for Single-Arm Cluster Tools With Residency Time Constraints
    Qiao, Yan
    Zhou, MengChu
    Wu, Naiqi
    Zhu, QingHua
    [J]. IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, 2017, 25 (04) : 1243 - 1256
  • [44] Schedulability and Scheduling Analysis of Dual-Arm Cluster Tools with Wafer Revisiting and Residency Time Constraints Based on a Novel Schedule
    Qiao, Yan
    Wu, NaiQi
    Zhou, MengChu
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2015, 45 (03): : 472 - 484
  • [45] Scheduling of Dual-Arm Cluster Tools With Wafer Revisiting and Residency Time Constraints
    Qiao, Yan
    Wu, Naiqi
    Zhou, MengChu
    [J]. IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2014, 10 (01) : 286 - 300
  • [46] Reisig W., 1985, EATCS MONOGRAPHS THE, V4, DOI [10.1007/978-3-642-69968-9, DOI 10.1007/978-3-642-69968-9]
  • [47] Two new robust genetic algorithms for the flowshop scheduling problem
    Ruiz, R
    Maroto, C
    Alcaraz, J
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (05): : 461 - 476
  • [48] Modeling and implementing a real-time scheduler for dual-armed cluster tools
    Shin, YH
    Lee, TE
    Kim, JH
    Lee, HY
    [J]. COMPUTERS IN INDUSTRY, 2001, 45 (01) : 13 - 27
  • [49] A 2.28-COMPETITIVE ALGORITHM FOR ONLINE SCHEDULING ON IDENTICAL MACHINES
    Tao, Jiping
    Huang, Ronghuan
    Liu, Tundong
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2015, 11 (01) : 185 - 198
  • [50] Fuzzy Mathematical Programming and Self-Adaptive Artificial Fish Swarm Algorithm for Just-in-Time Energy-Aware Flow Shop Scheduling Problem With Outsourcing Option
    Tirkolaee, Erfan Babaee
    Goli, Alireza
    Weber, Gerhard-Wilhelm
    [J]. IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2020, 28 (11) : 2772 - 2783