State dependant scheduling using a multi-objective approach다목적함수 접근을 사용한 상태 기반 스케쥴링

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 1042
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorLee, Tae-Eog-
dc.contributor.advisor이태억-
dc.contributor.authorUno Wikborg-
dc.contributor.authorWikborg Uno-
dc.date.accessioned2013-09-13-
dc.date.available2013-09-13-
dc.date.issued2013-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=513576&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/182535-
dc.description학위논문(박사) - 한국과학기술원 : 산업및시스템공학과, 2013.2, [ vi, 81 p. ]-
dc.description.abstractRecently, semiconductor manufacturing fabs tend to reduce the wafer lot size, down to just a few. Consequently, the wafer recipe or wafer flow pattern changes frequently. For such problems it is impossible to apply conventional prevalent cyclic scheduling methods that repeat processing of wafers in an identical cyclic tool operation sequence. We therefore consider the non-cyclic scheduling problem encountered in cluster tool scheduling. In Chapter 2 we dealt with scheduling of single armed cluster tools. Single armed cluster tools have a simpler architecture than other configurations, but can be difficult to schedule when additional requirements such as re-entrant wafer flow, parallel chambers and multiple recipes are introduced. To solve these problems we proposed a method to transforms the problem into a multi-objective problem by considering the ready times of the resources as objectives to minimize. Only feasible states were generated based on the initial state of the system. These feasible states form a multi-objective shortest path problem and give us O((r+1)mn) as an upper bound for the number of states, where r, n, and m are the number of different wafer recipes, wafers, and processing chambers. We solved this problem with implicit enumeration by making our scheduling decisions based on the Pareto optimal solutions for each state. The experimental results showed that the proposed algorithm can quickly solve large sized problems including ones with arbitrary initial tool states, changing recipes, re-entrant wafer flows, and parallel chambers. In Chapter 3 we developed a general scheduling algorithm for Petri nets. Petri nets are widely used for modelling and analysis of discrete event dynamic systems and are therefore suitable for scheduling more complex cluster tool architectures such as dual armed cluster tools. We defined a data structure for noncyclic Petri net scheduling problems and then transformed the scheduling problem into an equivalent multi-...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectscheduling-
dc.subjectPetri-net-
dc.subjectstate dependent-
dc.subject스케줄링-
dc.subject페트리넷-
dc.subject상태 기반-
dc.subject다이나믹 프로그래밍-
dc.subjectdynamic programming-
dc.titleState dependant scheduling using a multi-objective approach-
dc.title.alternative다목적함수 접근을 사용한 상태 기반 스케쥴링-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN513576/325007 -
dc.description.department한국과학기술원 : 산업및시스템공학과, -
dc.identifier.uid020085369-
dc.contributor.localauthorLee, Tae-Eog-
dc.contributor.localauthor이태억-
Appears in Collection
IE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0