An extended event graph with negative places and tokens for time window constraints

Cited 115 time in webofscience Cited 0 time in scopus
  • Hit : 1023
  • Download : 1239
DC FieldValueLanguage
dc.contributor.authorLee, Tae-Eogko
dc.contributor.authorPark, SHko
dc.date.accessioned2007-10-09T05:49:57Z-
dc.date.available2007-10-09T05:49:57Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2005-10-
dc.identifier.citationIEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, v.2, no.4, pp.319 - 332-
dc.identifier.issn1545-5955-
dc.identifier.urihttp://hdl.handle.net/10203/1699-
dc.description.abstractWe introduce places with negative holding times and tokens with negative token counts into a timed event graph in order to model and analyze time window constraints. We extend the enabling and firing rules for such an extended event graph named a negative event graph (NEG). We develop necessary and sufficient conditions based on the circuits for which the NEG is live, that is, an infinite sequence of feasible firing epochs exist for each transition. We prove that the minimum cycle time is the same as the maximum circuit ratio of the circuits with positive token counts. We also show that when there exists circuits with negative token counts, the maximum cycle time is bounded and the same as the minimum circuit ratio of such circuits. A scheduling example for a robot-based cluster tool with wafer residency time constraints for semiconductor manufacturing is explained.-
dc.description.sponsorshipKorea Science Foundation under Grant 98-0200-08-01-2, The Brain Korea 21 Project in 2004en
dc.languageEnglish-
dc.language.isoen_USen
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.subjectARMED CLUSTER TOOLS-
dc.subjectCYCLIC JOB SHOPS-
dc.subjectSCHEDULES-
dc.titleAn extended event graph with negative places and tokens for time window constraints-
dc.typeArticle-
dc.identifier.wosid000232481900002-
dc.identifier.scopusid2-s2.0-27644434964-
dc.type.rimsART-
dc.citation.volume2-
dc.citation.issue4-
dc.citation.beginningpage319-
dc.citation.endingpage332-
dc.citation.publicationnameIEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING-
dc.identifier.doi10.1109/TASE.2005.851236-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorLee, Tae-Eog-
dc.contributor.nonIdAuthorPark, SH-
dc.type.journalArticleArticle-
dc.subject.keywordAuthordiscrete event system-
dc.subject.keywordAuthornegative place-
dc.subject.keywordAuthornegative token-
dc.subject.keywordAuthorPetri net-
dc.subject.keywordAuthortime window constraint-
dc.subject.keywordPlusARMED CLUSTER TOOLS-
dc.subject.keywordPlusCYCLIC JOB SHOPS-
dc.subject.keywordPlusSCHEDULES-
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 115 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0