View Item 

Show simple item record

Dynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issues
dc.contributor.authorDubois, Didieren_US
dc.contributor.authorStecke, Kathryn E.en_US
dc.date.accessioned2006-09-11T14:21:59Z
dc.date.available2006-09-11T14:21:59Z
dc.date.issued1990-12en_US
dc.identifier.citationDubois, Didier; Stecke, Kathryn E.; (1990). "Dynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issues." Annals of Operations Research 26(1): 150-193. <http://hdl.handle.net/2027.42/44155>en_US
dc.identifier.issn0254-5330en_US
dc.identifier.issn1572-9338en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/44155
dc.description.abstractA model to analyze certain classes of discrete event dynamic systems is presented. Previous research on timed marked graphs is reviewed and extended. This model is useful to analyze asynchronous and repetitive production processes. In particular, applications to certain classes of flexible manufacturing systems are provided in a companion paper. Here, an algebraic representation of timed marked graphs in terms of reccurrence equations is provided. These equations are linear in a nonconventional algebra, that is described. Also, an algorithm to properly characterize the periodic behavior of repetitive production processes is descrbed. This model extends the concepts from PERT/CPM analysis to repetitive production processes.en_US
dc.format.extent1775119 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherBaltzer Science Publishers, Baarn/Kluwer Academic Publishers; J.C. Baltzer AG, Scientific Publishing Company ; Springer Science+Business Mediaen_US
dc.subject.otherEconomics / Management Scienceen_US
dc.subject.otherTheory of Computationen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherOperations Research/Decision Theoryen_US
dc.titleDynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issuesen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelIndustrial and Operations Engineeringen_US
dc.subject.hlbsecondlevelManagementen_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelBusinessen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumGraduate School of Business Administration, The University of Michigan, 48109, Ann Arbor, Michigan, USAen_US
dc.contributor.affiliationotherInstitut de Recherche en Informatique de Toulouse, Université Paul Sabatier, 118 Route de Narbonne, F-31062, Toulouse Cedex, Franceen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/44155/1/10479_2005_Article_BF02248590.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF02248590en_US
dc.identifier.sourceAnnals of Operations Researchen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10479_2005_Article_BF02248590.pdf
Size:
1.692MB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.