Scheduling and control of extended event graphs with negative places and tokens for time constrained discrete event systems시간제약이 있는 이산 사건 시스템 모델링을 위해 네거티브 플레이스와 네거티브 토큰을 사용한 확장된 이벤트 그래프의 스케줄링과 제어

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 623
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorLee, Tae-Eog-
dc.contributor.advisor이태억-
dc.contributor.authorPark, Seong-Ho-
dc.contributor.author박성호-
dc.date.accessioned2011-12-14T02:40:10Z-
dc.date.available2011-12-14T02:40:10Z-
dc.date.issued2005-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=244823&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/40576-
dc.description학위논문(박사) - 한국과학기술원 : 산업공학과, 2005.2, [ vii, 108 p. ]-
dc.description.abstractMany discrete event systems are subject to time constraints. For instance, in a cluster tool for semiconductor manufacturing, a wafer processed at a processing chamber should leave the chamber within a time limit. Otherwise, the wafer undergoes a severe quality problem due to residual gases or heat in the processing chamber. Hoist-based processing systems for printed circuit board manufacturing, microcircuits like digital signal processing, and real-time software systems also have similar time constraints. Such time constraints make scheduling decisions complicated. The critical scheduling issues include how the system with time constraints is modeled, whether there exists a feasible schedule that satisfies all time constraints, how a feasible schedule is identified or computed, and how the timings of the activities are controlled. There have been attempts for addressing some of the scheduling issues, including p-time Petri nets, PERT-like graph models, and linear programming models. Petri nets are known to be useful for modeling and analyzing discrete event dynamic systems. An interesting question is whether or how the Petri nets can be extended for addressing the time constraints. While p-time Petri nets or PERT-like graphs propose some extension, we still need a more unified Petri net theory that can model and analyze time constrained systems more systematically. To do this, places and tokens that are essential for representing the conditions and states of discrete event systems should be extended. In this thesis, we propose an extended event graph that can model and analyze decision-free discrete event systems with general time window constraints. To do this, we introduce places with negative holding times and tokens with negative token counts into a timed event graph. Such an extended graph is called a negative event graph(NEG). We define enabling and firing rules for NEGs and develop the theory for analyzing NEGs. We first examine the liveness of an NEG, ...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subject네거티브 플레이스-
dc.subject스케줄링-
dc.subject네거티브 이벤트 그래프-
dc.subject시간 윈도우 제약-
dc.subject이벤트 그래프-
dc.subjectnegative token-
dc.subjectnegative place-
dc.subjectscheduling-
dc.subject네거티브 토큰-
dc.subjectnegative event graph-
dc.subjecttime window constraints-
dc.subjectEvent graph-
dc.titleScheduling and control of extended event graphs with negative places and tokens for time constrained discrete event systems-
dc.title.alternative시간제약이 있는 이산 사건 시스템 모델링을 위해 네거티브 플레이스와 네거티브 토큰을 사용한 확장된 이벤트 그래프의 스케줄링과 제어-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN244823/325007 -
dc.description.department한국과학기술원 : 산업공학과, -
dc.identifier.uid000985135-
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