Optimization-based litho machine scheduling with load balancing and reticle expiration

The increasing demand for on-time delivery is forcing semiconductor manufacturers to seek more efficient schedules of machines and other resources to meet targets while making effective use of excess capacities. This paper presents the modeling and solution methodology of lithography machine schedul...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bing Yan, Hsin Yuan Chen, Luh, P. B., Wang, Simon, Chang, J.
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 580
container_issue
container_start_page 575
container_title
container_volume
creator Bing Yan
Hsin Yuan Chen
Luh, P. B.
Wang, Simon
Chang, J.
description The increasing demand for on-time delivery is forcing semiconductor manufacturers to seek more efficient schedules of machines and other resources to meet targets while making effective use of excess capacities. This paper presents the modeling and solution methodology of lithography machine scheduling with load balancing and reticle expiration consideration for the bottleneck process of semiconductor fabrication. A mixed-integer optimization model is established with capacity constraints and processing requirements. The objective is to meet daily targets, to keep load balancing, to avoid reticles shortage, and to reduce the number of machine setups. The problem formulated above is solved by the branch-and-cut method. Although the formulation is linearized, the practical size problem is still difficult to solve because the convex hull is hard to obtain. To overcome efficiency difficulty, some constraints are modified. To further improve efficiency, a two-phase model is established. The higher phase is to reduce the problem range by relaxing some constraints, and the lower phase is for scheduling. Numerical testing shows that the method can generate high quality schedules within reasonable time.
doi_str_mv 10.1109/CoASE.2012.6386493
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6386493</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6386493</ieee_id><sourcerecordid>6386493</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-216ce801faa400a512b0832b74332b55e39cc46111e7367a307ac7ee2060b42d3</originalsourceid><addsrcrecordid>eNpFkNtKw0AURccbWGt_QF_mB1LPXDKXxxJaFQp9sIhv5WRyakbSpCQRL19v1KIv-8BZsNhsxq4ETIUAf5M1s4f5VIKQU6Oc0V4dsQuhjVWgpXs6ZiMpjEgcOH_yD7w7_QMWztmk614AYDAa8G7EHlf7Pu7iJ_axqZMcOyp4Ffuy4TsMZayJd6Gk4rWK9TN_GwCvGix4jhXW4fuHdcFb6mOoiNP7PrY_pkt2tsWqo8nhjtl6MV9nd8lydXufzZZJ9NAnQ69ADsQWUQNgKmQOTsncajVkmpLyIWgjhCCrjEUFFoMlkkP5XMtCjdn1rzYS0Wbfxh22H5vDPOoL8WxVmQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimization-based litho machine scheduling with load balancing and reticle expiration</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bing Yan ; Hsin Yuan Chen ; Luh, P. B. ; Wang, Simon ; Chang, J.</creator><creatorcontrib>Bing Yan ; Hsin Yuan Chen ; Luh, P. B. ; Wang, Simon ; Chang, J.</creatorcontrib><description>The increasing demand for on-time delivery is forcing semiconductor manufacturers to seek more efficient schedules of machines and other resources to meet targets while making effective use of excess capacities. This paper presents the modeling and solution methodology of lithography machine scheduling with load balancing and reticle expiration consideration for the bottleneck process of semiconductor fabrication. A mixed-integer optimization model is established with capacity constraints and processing requirements. The objective is to meet daily targets, to keep load balancing, to avoid reticles shortage, and to reduce the number of machine setups. The problem formulated above is solved by the branch-and-cut method. Although the formulation is linearized, the practical size problem is still difficult to solve because the convex hull is hard to obtain. To overcome efficiency difficulty, some constraints are modified. To further improve efficiency, a two-phase model is established. The higher phase is to reduce the problem range by relaxing some constraints, and the lower phase is for scheduling. Numerical testing shows that the method can generate high quality schedules within reasonable time.</description><identifier>ISSN: 2161-8070</identifier><identifier>ISBN: 1467304298</identifier><identifier>ISBN: 9781467304290</identifier><identifier>EISSN: 2161-8089</identifier><identifier>EISBN: 146730428X</identifier><identifier>EISBN: 9781467304283</identifier><identifier>EISBN: 9781467304306</identifier><identifier>EISBN: 1467304301</identifier><identifier>DOI: 10.1109/CoASE.2012.6386493</identifier><language>eng</language><publisher>IEEE</publisher><subject>Job shop scheduling ; Linear programming ; Load management ; Load modeling ; Schedules ; Semiconductor device modeling ; Stacking</subject><ispartof>2012 IEEE International Conference on Automation Science and Engineering (CASE), 2012, p.575-580</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/6386493$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6386493$$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, J.</creatorcontrib><title>Optimization-based litho machine scheduling with load balancing and reticle expiration</title><title>2012 IEEE International Conference on Automation Science and Engineering (CASE)</title><addtitle>CoASE</addtitle><description>The increasing demand for on-time delivery is forcing semiconductor manufacturers to seek more efficient schedules of machines and other resources to meet targets while making effective use of excess capacities. This paper presents the modeling and solution methodology of lithography machine scheduling with load balancing and reticle expiration consideration for the bottleneck process of semiconductor fabrication. A mixed-integer optimization model is established with capacity constraints and processing requirements. The objective is to meet daily targets, to keep load balancing, to avoid reticles shortage, and to reduce the number of machine setups. The problem formulated above is solved by the branch-and-cut method. Although the formulation is linearized, the practical size problem is still difficult to solve because the convex hull is hard to obtain. To overcome efficiency difficulty, some constraints are modified. To further improve efficiency, a two-phase model is established. The higher phase is to reduce the problem range by relaxing some constraints, and the lower phase is for scheduling. Numerical testing shows that the method can generate high quality schedules within reasonable time.</description><subject>Job shop scheduling</subject><subject>Linear programming</subject><subject>Load management</subject><subject>Load modeling</subject><subject>Schedules</subject><subject>Semiconductor device modeling</subject><subject>Stacking</subject><issn>2161-8070</issn><issn>2161-8089</issn><isbn>1467304298</isbn><isbn>9781467304290</isbn><isbn>146730428X</isbn><isbn>9781467304283</isbn><isbn>9781467304306</isbn><isbn>1467304301</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkNtKw0AURccbWGt_QF_mB1LPXDKXxxJaFQp9sIhv5WRyakbSpCQRL19v1KIv-8BZsNhsxq4ETIUAf5M1s4f5VIKQU6Oc0V4dsQuhjVWgpXs6ZiMpjEgcOH_yD7w7_QMWztmk614AYDAa8G7EHlf7Pu7iJ_axqZMcOyp4Ffuy4TsMZayJd6Gk4rWK9TN_GwCvGix4jhXW4fuHdcFb6mOoiNP7PrY_pkt2tsWqo8nhjtl6MV9nd8lydXufzZZJ9NAnQ69ADsQWUQNgKmQOTsncajVkmpLyIWgjhCCrjEUFFoMlkkP5XMtCjdn1rzYS0Wbfxh22H5vDPOoL8WxVmQ</recordid><startdate>201208</startdate><enddate>201208</enddate><creator>Bing Yan</creator><creator>Hsin Yuan Chen</creator><creator>Luh, P. B.</creator><creator>Wang, Simon</creator><creator>Chang, J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201208</creationdate><title>Optimization-based litho machine scheduling with load balancing and reticle expiration</title><author>Bing Yan ; Hsin Yuan Chen ; Luh, P. B. ; Wang, Simon ; Chang, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-216ce801faa400a512b0832b74332b55e39cc46111e7367a307ac7ee2060b42d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Job shop scheduling</topic><topic>Linear programming</topic><topic>Load management</topic><topic>Load modeling</topic><topic>Schedules</topic><topic>Semiconductor device modeling</topic><topic>Stacking</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, J.</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, J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimization-based litho machine scheduling with load balancing and reticle expiration</atitle><btitle>2012 IEEE International Conference on Automation Science and Engineering (CASE)</btitle><stitle>CoASE</stitle><date>2012-08</date><risdate>2012</risdate><spage>575</spage><epage>580</epage><pages>575-580</pages><issn>2161-8070</issn><eissn>2161-8089</eissn><isbn>1467304298</isbn><isbn>9781467304290</isbn><eisbn>146730428X</eisbn><eisbn>9781467304283</eisbn><eisbn>9781467304306</eisbn><eisbn>1467304301</eisbn><abstract>The increasing demand for on-time delivery is forcing semiconductor manufacturers to seek more efficient schedules of machines and other resources to meet targets while making effective use of excess capacities. This paper presents the modeling and solution methodology of lithography machine scheduling with load balancing and reticle expiration consideration for the bottleneck process of semiconductor fabrication. A mixed-integer optimization model is established with capacity constraints and processing requirements. The objective is to meet daily targets, to keep load balancing, to avoid reticles shortage, and to reduce the number of machine setups. The problem formulated above is solved by the branch-and-cut method. Although the formulation is linearized, the practical size problem is still difficult to solve because the convex hull is hard to obtain. To overcome efficiency difficulty, some constraints are modified. To further improve efficiency, a two-phase model is established. The higher phase is to reduce the problem range by relaxing some constraints, and the lower phase is for scheduling. Numerical testing shows that the method can generate high quality schedules within reasonable time.</abstract><pub>IEEE</pub><doi>10.1109/CoASE.2012.6386493</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2161-8070
ispartof 2012 IEEE International Conference on Automation Science and Engineering (CASE), 2012, p.575-580
issn 2161-8070
2161-8089
language eng
recordid cdi_ieee_primary_6386493
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Job shop scheduling
Linear programming
Load management
Load modeling
Schedules
Semiconductor device modeling
Stacking
title Optimization-based litho machine scheduling with load balancing and reticle expiration
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T20%3A49%3A03IST&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%20load%20balancing%20and%20reticle%20expiration&rft.btitle=2012%20IEEE%20International%20Conference%20on%20Automation%20Science%20and%20Engineering%20(CASE)&rft.au=Bing%20Yan&rft.date=2012-08&rft.spage=575&rft.epage=580&rft.pages=575-580&rft.issn=2161-8070&rft.eissn=2161-8089&rft.isbn=1467304298&rft.isbn_list=9781467304290&rft_id=info:doi/10.1109/CoASE.2012.6386493&rft_dat=%3Cieee_6IE%3E6386493%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=146730428X&rft.eisbn_list=9781467304283&rft.eisbn_list=9781467304306&rft.eisbn_list=1467304301&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6386493&rfr_iscdi=true