Cyclic scheduling of timed petri nets : behavior, optimization, and application to cluster tools시간을 갖는 페트리넷의 주기적 스케쥴링 : 행태, 최적화, 클러스터 장비에의 응용

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 881
  • Download : 0
Many automated manufacturing systems such as robotized cluster tools for semiconductor manufacturing often repeat identical work cycles and hence have cyclic behavior. There have been many works on cyclic scheduling of specific manufacturing systems. Timed Petri nets (TPN) have been used for modeling and analyzing a wide class of such manufacturing systems or discrete event dynamic systems. A manufacturing system such as a cluster tool that is operated by cyclic scheduling can be modeled by a TPN that has a cyclic token routing rule at the conflict places. Most existing works on Petri nets and TPNs have focused on structural analysis, deadlock analysis, and performance analysis. However, we wish to develop a cyclic scheduling theory and solution methods for general TPNs, which can be used for a wide class of cyclic scheduling systems and problems. In this thesis, we examine dynamic behavior of TPNs with cyclic token routing, optimization models and solution methods for scheduling, and application to cluster tool scheduling. In Chapter 2, we examine cyclic behavior of TPNs. We first propose definitions and classifications of cyclic schedules of TPNs based on the token routing method at the conflict places and firing epochs. We then develop conditions for which cyclic schedules exist and identify marking bounds of the places for a cyclic schedule. We also develop an efficient mixed integer programming (MIP) model for finding a cyclic schedule that minimizes the cycle time. To do this, we use a state equation of the TPN model and an assignment model on ordering the transition firing epochs while most existing MIP models for cyclic scheduling of cluster tools rely on traveling salesman problems for sequencing the robot tasks. In Chapter 3, we apply the cyclic scheduling theory and methods for TPNs to a few complex cluster tool scheduling problems. We demonstrate computation efficiency of the proposed MIP model for a tool scheduling problem, which is solved by ...
Advisors
Lee, Tae-Eogresearcher이태억researcher
Description
한국과학기술원 : 산업및시스템공학과,
Publisher
한국과학기술원
Issue Date
2010
Identifier
455349/325007  / 020065161
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 산업및시스템공학과, 2010.08, [ ix, 95 p. ]

Keywords

Petri nets; 클러스터 툴; 브랜지 앤 바운드 알고리즘; 페트리넷; 주기적 스케쥴링; timed event graph; branch and bound algorithm; 타임드 이벤트 그래프; cyclic scheduling; cluster tools

URI
http://hdl.handle.net/10203/40669
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=455349&flag=dissertation
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