基于优化的光刻机调度与多个线和设置

B. Yan, Hsin Yuan Chen, P. Luh, Simon Wang, Joey Chang
{"title":"基于优化的光刻机调度与多个线和设置","authors":"B. Yan, Hsin Yuan Chen, P. Luh, Simon Wang, Joey Chang","doi":"10.1109/CASE.2011.6042516","DOIUrl":null,"url":null,"abstract":"The increasing demand for on-time delivery and low cost is forcing semiconductor manufacturers to seek more efficient schedules to allocate machines and other resources to minimize the cost associated with other features, such as setup. This paper presents the modeling and solution of litho machine scheduling with multiple reticles and setups in lithography, the bottleneck process of fabricating wafers in the semiconductor industry. For the litho machine scheduling under consideration, there are daily targets for every layer of several products, therefore, there is no need to number and distinguish different lots. A mixed integer optimization formulation is established with litho machines and reticles. The objective is to meet daily target, and reduce the number of setups. By linearizing processing time constraints and objective function, the problem is effectively solved by using branch and cut method. Several approaches, such as node selection strategy, are used to improve efficiency. Numerical testing shows that the method can generate high quality schedules within reasonable time.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Optimization-based litho machine scheduling with multiple reticles and setups\",\"authors\":\"B. Yan, Hsin Yuan Chen, P. Luh, Simon Wang, Joey Chang\",\"doi\":\"10.1109/CASE.2011.6042516\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The increasing demand for on-time delivery and low cost is forcing semiconductor manufacturers to seek more efficient schedules to allocate machines and other resources to minimize the cost associated with other features, such as setup. This paper presents the modeling and solution of litho machine scheduling with multiple reticles and setups in lithography, the bottleneck process of fabricating wafers in the semiconductor industry. For the litho machine scheduling under consideration, there are daily targets for every layer of several products, therefore, there is no need to number and distinguish different lots. A mixed integer optimization formulation is established with litho machines and reticles. The objective is to meet daily target, and reduce the number of setups. By linearizing processing time constraints and objective function, the problem is effectively solved by using branch and cut method. Several approaches, such as node selection strategy, are used to improve efficiency. Numerical testing shows that the method can generate high quality schedules within reasonable time.\",\"PeriodicalId\":236208,\"journal\":{\"name\":\"2011 IEEE International Conference on Automation Science and Engineering\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Automation Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASE.2011.6042516\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Automation Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE.2011.6042516","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

对准时交货和低成本的需求日益增长,迫使半导体制造商寻求更有效的计划来分配机器和其他资源,以最大限度地降低与其他功能(如设置)相关的成本。本文介绍了半导体工业中制造晶圆的瓶颈工艺——光刻工艺的多线和多台光刻机调度建模和解决方案。对于正在考虑的光刻机调度,几个产品的每一层都有每日目标,因此不需要编号和区分不同的批次。利用光刻机和光刻线建立了一个混合整数优化公式。目标是达到每日目标,并减少安装数量。通过对加工时间约束和目标函数的线性化,采用分支切割法有效地解决了这一问题。采用节点选择策略等方法来提高效率。数值试验表明,该方法可以在合理的时间内生成高质量的调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization-based litho machine scheduling with multiple reticles and setups
The increasing demand for on-time delivery and low cost is forcing semiconductor manufacturers to seek more efficient schedules to allocate machines and other resources to minimize the cost associated with other features, such as setup. This paper presents the modeling and solution of litho machine scheduling with multiple reticles and setups in lithography, the bottleneck process of fabricating wafers in the semiconductor industry. For the litho machine scheduling under consideration, there are daily targets for every layer of several products, therefore, there is no need to number and distinguish different lots. A mixed integer optimization formulation is established with litho machines and reticles. The objective is to meet daily target, and reduce the number of setups. By linearizing processing time constraints and objective function, the problem is effectively solved by using branch and cut method. Several approaches, such as node selection strategy, are used to improve efficiency. Numerical testing shows that the method can generate high quality schedules within reasonable time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信