A Virtual Wafer-based Scheduling Method for Dual-arm Cluster Tools with Chamber Cleaning Requirements

Yan Qiao, Jie Li, Yanjun Lu, SiWei Zhang, N. Wu, Bin Liu
{"title":"A Virtual Wafer-based Scheduling Method for Dual-arm Cluster Tools with Chamber Cleaning Requirements","authors":"Yan Qiao, Jie Li, Yanjun Lu, SiWei Zhang, N. Wu, Bin Liu","doi":"10.1109/ICNSC52481.2021.9702173","DOIUrl":null,"url":null,"abstract":"Cluster tools play a significant role in the entire process of wafer fabrication. Wafer residency time constraints and chamber cleaning requirements are commonly seen in etching, chemical vapor deposition, coating processes, etc. They make the scheduling problem of cluster tools more challenging. This work aims to provide a solution for dual-arm cluster tools with wafer residency time constraints and chamber cleaning requirements. To do so, it proposes a novel virtual wafer-based scheduling method. By this method, under a steady state, a process module (PM) processes either a real or virtual wafer at a time. When a PM processes a virtual one, its chamber performs a cleaning operation. In this way, we can meet not only the strict residency time constraints for real wafers, but also innovatively performs chamber cleaning operations as required. Based on such a novel scheduling method, an efficient binary integer programming model is established to maximize the throughput of cluster tools. Finally, experiments are performed to show the efficiency and effectiveness of the proposed method.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC52481.2021.9702173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Cluster tools play a significant role in the entire process of wafer fabrication. Wafer residency time constraints and chamber cleaning requirements are commonly seen in etching, chemical vapor deposition, coating processes, etc. They make the scheduling problem of cluster tools more challenging. This work aims to provide a solution for dual-arm cluster tools with wafer residency time constraints and chamber cleaning requirements. To do so, it proposes a novel virtual wafer-based scheduling method. By this method, under a steady state, a process module (PM) processes either a real or virtual wafer at a time. When a PM processes a virtual one, its chamber performs a cleaning operation. In this way, we can meet not only the strict residency time constraints for real wafers, but also innovatively performs chamber cleaning operations as required. Based on such a novel scheduling method, an efficient binary integer programming model is established to maximize the throughput of cluster tools. Finally, experiments are performed to show the efficiency and effectiveness of the proposed method.
具有腔室清洗要求的双臂集群工具的虚拟晶圆调度方法
集束工具在晶圆制造的整个过程中起着重要的作用。晶圆驻留时间限制和腔室清洁要求通常见于蚀刻、化学气相沉积、涂层工艺等。它们使集群工具的调度问题更具挑战性。这项工作旨在为具有晶圆驻留时间限制和腔室清洁要求的双臂群集工具提供解决方案。为此,提出了一种基于虚拟晶圆的调度方法。通过这种方法,在稳定状态下,工艺模块(PM)一次处理一个真实或虚拟晶圆。当PM处理虚拟时,其腔室执行清洁操作。通过这种方式,我们不仅可以满足真实晶圆严格的驻留时间限制,还可以根据需要创新地进行腔室清洗操作。基于这种新颖的调度方法,建立了一个有效的二进制整数规划模型,使集群工具的吞吐量最大化。最后,通过实验验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信