Cyclic Scheduling Analysis of Single-arm Cluster Tools with Wafer Residency Time Constraint and Chamber Cleaning Operations

Fajun Yang, N. Wu, R. Su, Yan Qiao
{"title":"Cyclic Scheduling Analysis of Single-arm Cluster Tools with Wafer Residency Time Constraint and Chamber Cleaning Operations","authors":"Fajun Yang, N. Wu, R. Su, Yan Qiao","doi":"10.1109/COASE.2018.8560461","DOIUrl":null,"url":null,"abstract":"In semiconductor manufacturing, a cleaning operation that takes significant time is required for eliminating the chemical residual in a chamber after a wafer being processed and removed from it. Such a cleaning operation makes a traditional backward strategy inefficient. In the existing work, it is shown that the productivity can be improved if some of chambers at a step are kept empty. With this idea, an extended backward strategy is proposed by deciding the optimal number of empty chambers. Based on such a strategy, this work studies the challenging problem for scheduling a single-arm cluster tool with both chamber cleaning operations and wafer residency time constraint for the first time. By building timed Petri net model for the system, two linear programs are proposed to determine the minimal cycle time and test the existence of a feasible schedule. At last, an industrial example is used to demonstrate the obtained results.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"17 1","pages":"241-246"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2018.8560461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In semiconductor manufacturing, a cleaning operation that takes significant time is required for eliminating the chemical residual in a chamber after a wafer being processed and removed from it. Such a cleaning operation makes a traditional backward strategy inefficient. In the existing work, it is shown that the productivity can be improved if some of chambers at a step are kept empty. With this idea, an extended backward strategy is proposed by deciding the optimal number of empty chambers. Based on such a strategy, this work studies the challenging problem for scheduling a single-arm cluster tool with both chamber cleaning operations and wafer residency time constraint for the first time. By building timed Petri net model for the system, two linear programs are proposed to determine the minimal cycle time and test the existence of a feasible schedule. At last, an industrial example is used to demonstrate the obtained results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有晶圆驻留时间约束和腔室清洗操作的单臂集束工具循环调度分析
在半导体制造中,需要花费大量时间来消除晶圆加工和去除后腔室中的化学残留物。这样的清理操作使得传统的落后策略变得低效。在现有的工作中,如果在一个步骤中保持一些腔室空,则可以提高生产率。在此基础上,通过确定空腔的最优数量,提出了一种扩展后向策略。基于该策略,本文首次研究了具有腔室清洗操作和晶圆驻留时间约束的单臂簇状工具的调度问题。通过建立系统的定时Petri网模型,提出了两种线性规划来确定系统的最小循环时间,并检验了可行调度的存在性。最后,通过一个工业实例对所得结果进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automated Electric-Field-Based Nanowire Characterization, Manipulation, and Assembly Dynamic Sampling for Feasibility Determination Gripping Positions Selection for Unfolding a Rectangular Cloth Product Multi-Robot Routing Algorithms for Robots Operating in Vineyards Enhancing Data-Driven Models with Knowledge from Engineering Models in Manufacturing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1