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}
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.