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...
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 119 |
---|---|
container_issue | |
container_start_page | 114 |
container_title | |
container_volume | |
creator | Bing Yan Hsin Yuan Chen Luh, P. B. Wang, Simon Chang, Joey |
description | 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. |
doi_str_mv | 10.1109/CASE.2011.6042516 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6042516</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6042516</ieee_id><sourcerecordid>6042516</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-1db09d167af5daeba6b0fadd52a5f8b3e39b6fc539e41e984bb46391bf2e263e3</originalsourceid><addsrcrecordid>eNpF0MtOwzAUBFDzkiilH4DY-AcSfO3EjpdVVB5SURd0X9nxDTFK0ih2hODriUQFs5nFkWYxhNwBSwGYfijXb5uUM4BUsoznIM_IDWS5UqAEL87JgoOEpGCFvvgHBpd_oNg1WYXwweZIWSglFuR1N0Tf-W8T_bFPrAnoaOtjc6SdqRrfIw1Vg25qff9OP2eg3dRGP7RIR4y-ajFQ0zsaME5DuCVXtWkDrk69JPvHzb58Tra7p5dyvU28ZjEBZ5l2IJWpc2fQGmlZbZzLucnrwgoU2sq6yoXGDFAXmbWZFBpszZHLmZfk_nfWI-JhGH1nxq_D6RXxA4VjU9g</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimization-based litho machine scheduling with multiple reticles and setups</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bing Yan ; Hsin Yuan Chen ; Luh, P. B. ; Wang, Simon ; Chang, Joey</creator><creatorcontrib>Bing Yan ; Hsin Yuan Chen ; Luh, P. B. ; Wang, Simon ; Chang, Joey</creatorcontrib><description>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.</description><identifier>ISSN: 2161-8070</identifier><identifier>ISBN: 1457717301</identifier><identifier>ISBN: 9781457717307</identifier><identifier>EISSN: 2161-8089</identifier><identifier>EISBN: 1457717328</identifier><identifier>EISBN: 145771731X</identifier><identifier>EISBN: 9781457717321</identifier><identifier>EISBN: 9781457717314</identifier><identifier>DOI: 10.1109/CASE.2011.6042516</identifier><language>eng</language><publisher>IEEE</publisher><subject>Equations ; Input variables ; Job shop scheduling ; Lithography ; Optimization ; Schedules ; Tunneling magnetoresistance</subject><ispartof>2011 IEEE International Conference on Automation Science and Engineering, 2011, p.114-119</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6042516$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6042516$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bing Yan</creatorcontrib><creatorcontrib>Hsin Yuan Chen</creatorcontrib><creatorcontrib>Luh, P. B.</creatorcontrib><creatorcontrib>Wang, Simon</creatorcontrib><creatorcontrib>Chang, Joey</creatorcontrib><title>Optimization-based litho machine scheduling with multiple reticles and setups</title><title>2011 IEEE International Conference on Automation Science and Engineering</title><addtitle>CASE</addtitle><description>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.</description><subject>Equations</subject><subject>Input variables</subject><subject>Job shop scheduling</subject><subject>Lithography</subject><subject>Optimization</subject><subject>Schedules</subject><subject>Tunneling magnetoresistance</subject><issn>2161-8070</issn><issn>2161-8089</issn><isbn>1457717301</isbn><isbn>9781457717307</isbn><isbn>1457717328</isbn><isbn>145771731X</isbn><isbn>9781457717321</isbn><isbn>9781457717314</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpF0MtOwzAUBFDzkiilH4DY-AcSfO3EjpdVVB5SURd0X9nxDTFK0ih2hODriUQFs5nFkWYxhNwBSwGYfijXb5uUM4BUsoznIM_IDWS5UqAEL87JgoOEpGCFvvgHBpd_oNg1WYXwweZIWSglFuR1N0Tf-W8T_bFPrAnoaOtjc6SdqRrfIw1Vg25qff9OP2eg3dRGP7RIR4y-ajFQ0zsaME5DuCVXtWkDrk69JPvHzb58Tra7p5dyvU28ZjEBZ5l2IJWpc2fQGmlZbZzLucnrwgoU2sq6yoXGDFAXmbWZFBpszZHLmZfk_nfWI-JhGH1nxq_D6RXxA4VjU9g</recordid><startdate>201108</startdate><enddate>201108</enddate><creator>Bing Yan</creator><creator>Hsin Yuan Chen</creator><creator>Luh, P. B.</creator><creator>Wang, Simon</creator><creator>Chang, Joey</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201108</creationdate><title>Optimization-based litho machine scheduling with multiple reticles and setups</title><author>Bing Yan ; Hsin Yuan Chen ; Luh, P. B. ; Wang, Simon ; Chang, Joey</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-1db09d167af5daeba6b0fadd52a5f8b3e39b6fc539e41e984bb46391bf2e263e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Equations</topic><topic>Input variables</topic><topic>Job shop scheduling</topic><topic>Lithography</topic><topic>Optimization</topic><topic>Schedules</topic><topic>Tunneling magnetoresistance</topic><toplevel>online_resources</toplevel><creatorcontrib>Bing Yan</creatorcontrib><creatorcontrib>Hsin Yuan Chen</creatorcontrib><creatorcontrib>Luh, P. B.</creatorcontrib><creatorcontrib>Wang, Simon</creatorcontrib><creatorcontrib>Chang, Joey</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bing Yan</au><au>Hsin Yuan Chen</au><au>Luh, P. B.</au><au>Wang, Simon</au><au>Chang, Joey</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimization-based litho machine scheduling with multiple reticles and setups</atitle><btitle>2011 IEEE International Conference on Automation Science and Engineering</btitle><stitle>CASE</stitle><date>2011-08</date><risdate>2011</risdate><spage>114</spage><epage>119</epage><pages>114-119</pages><issn>2161-8070</issn><eissn>2161-8089</eissn><isbn>1457717301</isbn><isbn>9781457717307</isbn><eisbn>1457717328</eisbn><eisbn>145771731X</eisbn><eisbn>9781457717321</eisbn><eisbn>9781457717314</eisbn><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.</abstract><pub>IEEE</pub><doi>10.1109/CASE.2011.6042516</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2161-8070 |
ispartof | 2011 IEEE International Conference on Automation Science and Engineering, 2011, p.114-119 |
issn | 2161-8070 2161-8089 |
language | eng |
recordid | cdi_ieee_primary_6042516 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Equations Input variables Job shop scheduling Lithography Optimization Schedules Tunneling magnetoresistance |
title | Optimization-based litho machine scheduling with multiple reticles and setups |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T21%3A08%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimization-based%20litho%20machine%20scheduling%20with%20multiple%20reticles%20and%20setups&rft.btitle=2011%20IEEE%20International%20Conference%20on%20Automation%20Science%20and%20Engineering&rft.au=Bing%20Yan&rft.date=2011-08&rft.spage=114&rft.epage=119&rft.pages=114-119&rft.issn=2161-8070&rft.eissn=2161-8089&rft.isbn=1457717301&rft.isbn_list=9781457717307&rft_id=info:doi/10.1109/CASE.2011.6042516&rft_dat=%3Cieee_6IE%3E6042516%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457717328&rft.eisbn_list=145771731X&rft.eisbn_list=9781457717321&rft.eisbn_list=9781457717314&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6042516&rfr_iscdi=true |