Scheduling Single-Armed Cluster Tools With Chamber Cleaning Operations

Cited 32 time in webofscience Cited 0 time in scopus
  • Hit : 617
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorYu, Tae Sunko
dc.contributor.authorKim, Hyunjungko
dc.contributor.authorLee, Tae-Eogko
dc.date.accessioned2018-05-23T06:30:09Z-
dc.date.available2018-05-23T06:30:09Z-
dc.date.created2017-06-21-
dc.date.created2017-06-21-
dc.date.created2017-06-21-
dc.date.created2017-06-21-
dc.date.created2017-06-21-
dc.date.issued2018-04-
dc.identifier.citationIEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, v.15, no.2, pp.705 - 716-
dc.identifier.issn1545-5955-
dc.identifier.urihttp://hdl.handle.net/10203/241523-
dc.description.abstractAs wafer circuit widths shrink down, wafer fabrication processes require stringent quality control. Therefore, fabs recently tend to clean a chamber after processing each wafer, in order to remove chemical residuals within the chamber. Such chamber cleaning, called purge operation, increases scheduling complexity in robotized cluster tools. In this paper, we examine scheduling problems of single-armed cluster tools with purge operations for series-parallel chambers. By extending the well-known backward sequence, we propose a backward(z) sequence that allows partial loading for parallel chambers, where vector z specifies how many chambers zi of each process step i are kept empty for cleaning. We then propose a way of finding optimal vector z* and identify when backward(z*) achieves the minimum cycle time among all possible sequences. We present experimental results on the accuracy of backward(z*).-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.titleScheduling Single-Armed Cluster Tools With Chamber Cleaning Operations-
dc.typeArticle-
dc.identifier.wosid000429217900024-
dc.identifier.scopusid2-s2.0-85018633421-
dc.type.rimsART-
dc.citation.volume15-
dc.citation.issue2-
dc.citation.beginningpage705-
dc.citation.endingpage716-
dc.citation.publicationnameIEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING-
dc.identifier.doi10.1109/TASE.2017.2682271-
dc.contributor.localauthorKim, Hyunjung-
dc.contributor.localauthorLee, Tae-Eog-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorAutomation-
dc.subject.keywordAuthorcleaning-
dc.subject.keywordAuthorcluster tool-
dc.subject.keywordAuthorPetri net-
dc.subject.keywordAuthorscheduling-
dc.subject.keywordAuthorsemiconductor manufacturing-
dc.subject.keywordPlusSTEADY-STATE THROUGHPUT-
dc.subject.keywordPlusTIME WINDOW CONSTRAINTS-
dc.subject.keywordPlusROBOTIC CELLS-
dc.subject.keywordPlusPETRI-NET-
dc.subject.keywordPlusMULTICLUSTER TOOLS-
dc.subject.keywordPlusBOUND ALGORITHM-
dc.subject.keywordPlusEVENT GRAPH-
dc.subject.keywordPlusSCHEDULABILITY-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 32 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0