考虑晶圆重访的单臂集束工具的优化调度

Zicheng Liu, N. Wu, Fajun Yang, Yan Qiao
{"title":"考虑晶圆重访的单臂集束工具的优化调度","authors":"Zicheng Liu, N. Wu, Fajun Yang, Yan Qiao","doi":"10.1109/WODES.2016.7497872","DOIUrl":null,"url":null,"abstract":"It is very difficult to schedule a single-arm cluster tool with wafer revisiting such that wafer residency time constraints are satisfied. This paper conducts a study on this challenging problem for a single-arm cluster tool with atomic layer deposition (ALD) process. With a so called p-backward strategy being applied, a Petri net model is developed to describe the dynamic behavior of the system. Based on the model, existence of a feasible schedule is analyzed, schedulability conditions are derived, and a scheduling algorithm is presented if there is a schedule. A schedule is obtained by simply setting the robot waiting time and it is very computationally efficient. The obtained schedule is shown to be optimal. Illustrative examples are given to demonstrate the proposed approach.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimal scheduling of time-constrained single-arm cluster tools with wafer revisiting\",\"authors\":\"Zicheng Liu, N. Wu, Fajun Yang, Yan Qiao\",\"doi\":\"10.1109/WODES.2016.7497872\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is very difficult to schedule a single-arm cluster tool with wafer revisiting such that wafer residency time constraints are satisfied. This paper conducts a study on this challenging problem for a single-arm cluster tool with atomic layer deposition (ALD) process. With a so called p-backward strategy being applied, a Petri net model is developed to describe the dynamic behavior of the system. Based on the model, existence of a feasible schedule is analyzed, schedulability conditions are derived, and a scheduling algorithm is presented if there is a schedule. A schedule is obtained by simply setting the robot waiting time and it is very computationally efficient. The obtained schedule is shown to be optimal. Illustrative examples are given to demonstrate the proposed approach.\",\"PeriodicalId\":268613,\"journal\":{\"name\":\"2016 13th International Workshop on Discrete Event Systems (WODES)\",\"volume\":\"161 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 13th International Workshop on Discrete Event Systems (WODES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2016.7497872\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 13th International Workshop on Discrete Event Systems (WODES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2016.7497872","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在满足晶圆驻留时间限制的情况下,很难安排具有晶圆重访功能的单臂聚类工具。本文针对原子层沉积(ALD)工艺单臂簇状工具的这一具有挑战性的问题进行了研究。采用p-backward策略,建立了Petri网模型来描述系统的动态行为。在此基础上,分析了可行调度的存在性,导出了调度的可调度性条件,并给出了存在调度时的调度算法。通过简单地设定机器人的等待时间就可以得到一个时间表,并且计算效率很高。得到的调度是最优的。给出了实例来说明所提出的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal scheduling of time-constrained single-arm cluster tools with wafer revisiting
It is very difficult to schedule a single-arm cluster tool with wafer revisiting such that wafer residency time constraints are satisfied. This paper conducts a study on this challenging problem for a single-arm cluster tool with atomic layer deposition (ALD) process. With a so called p-backward strategy being applied, a Petri net model is developed to describe the dynamic behavior of the system. Based on the model, existence of a feasible schedule is analyzed, schedulability conditions are derived, and a scheduling algorithm is presented if there is a schedule. A schedule is obtained by simply setting the robot waiting time and it is very computationally efficient. The obtained schedule is shown to be optimal. Illustrative examples are given to demonstrate the proposed approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信