Integrated Scheduling of a Dual-Armed Cluster Tool for Maximizing Steady Schedule Patterns

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 74
  • Download : 28
DC FieldValueLanguage
dc.contributor.authorKim, Woojinko
dc.contributor.authorYu, Tae-Sunko
dc.contributor.authorLee, Tae-Eogko
dc.date.accessioned2021-11-29T06:40:34Z-
dc.date.available2021-11-29T06:40:34Z-
dc.date.created2021-06-10-
dc.date.created2021-06-10-
dc.date.created2021-06-10-
dc.date.issued2021-12-
dc.identifier.citationIEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS: SYSTEMS, v.51, no.12, pp.7282 - 7294-
dc.identifier.issn2168-2216-
dc.identifier.urihttp://hdl.handle.net/10203/289593-
dc.description.abstractA cluster tool consists of several single-wafer processing chambers and a wafer handling robot. A wafer has to wait within a chamber after being processed there until it is unloaded by the robot. Such wafer delays may cause wafer quality degradation or variability due to residual gases and heat in the chamber. The tool operation schedule has to maintain identical timing patterns or schedules for each cycle so as to keep wafer delays constant for every wafer. However, at the beginning of the tool operation, the tool is in an empty state and hence we need to make the tool reach such steady schedule by loading wafers into the tool. In this article, we develop a method of scheduling the robot tasks during the start-up period of a cluster tool to reach a target steady schedule quickly as possible. To do this, we model the behaviors of a cluster tool using timed Petri nets and linear system matrices in the max-plus algebra. By analyzing the matrices, we first identify a class of steady schedules which can be reached from the empty tool. We develop the matrices that explain the schedule evolution of the start-up period before reaching the steady period. By examining the matrices, we develop a method of choosing the most desirable one from such class of reachable steady schedules that can be achieved in the minimum time. We also prove that the schedule also minimizes the time duration of the close-down. Finally, we present computational experiments.-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.titleIntegrated Scheduling of a Dual-Armed Cluster Tool for Maximizing Steady Schedule Patterns-
dc.typeArticle-
dc.identifier.wosid000720521100009-
dc.type.rimsART-
dc.citation.volume51-
dc.citation.issue12-
dc.citation.beginningpage7282-
dc.citation.endingpage7294-
dc.citation.publicationnameIEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS: SYSTEMS-
dc.identifier.doi10.1109/tsmc.2020.2978486-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorLee, Tae-Eog-
dc.contributor.nonIdAuthorKim, Woojin-
dc.contributor.nonIdAuthorYu, Tae-Sun-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorTools-
dc.subject.keywordAuthorSchedules-
dc.subject.keywordAuthorDelays-
dc.subject.keywordAuthorRobots-
dc.subject.keywordAuthorTransient analysis-
dc.subject.keywordAuthorSteady-state-
dc.subject.keywordAuthorTask analysis-
dc.subject.keywordAuthorClose-down-
dc.subject.keywordAuthorcluster tool-
dc.subject.keywordAuthormax-plus algebra-
dc.subject.keywordAuthorstart-up-
dc.subject.keywordAuthorsteady state-
dc.subject.keywordAuthortimed event graph (TEG)-
dc.subject.keywordAuthortransient state-
dc.subject.keywordPlusSTART-UP-
dc.subject.keywordPlusTRANSIENT PROCESSES-
dc.subject.keywordPlusSTATE THROUGHPUT-
dc.subject.keywordPlusPETRI NETS-
dc.subject.keywordPlusBLADE-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0