Dynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issues
dc.contributor.author | Dubois, Didier | en_US |
dc.contributor.author | Stecke, Kathryn E. | en_US |
dc.date.accessioned | 2006-09-11T14:21:59Z | |
dc.date.available | 2006-09-11T14:21:59Z | |
dc.date.issued | 1990-12 | en_US |
dc.identifier.citation | Dubois, 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.issn | 0254-5330 | en_US |
dc.identifier.issn | 1572-9338 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/44155 | |
dc.description.abstract | A 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.extent | 1775119 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Baltzer Science Publishers, Baarn/Kluwer Academic Publishers; J.C. Baltzer AG, Scientific Publishing Company ; Springer Science+Business Media | en_US |
dc.subject.other | Economics / Management Science | en_US |
dc.subject.other | Theory of Computation | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Operations Research/Decision Theory | en_US |
dc.title | Dynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issues | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Graduate School of Business Administration, The University of Michigan, 48109, Ann Arbor, Michigan, USA | en_US |
dc.contributor.affiliationother | Institut de Recherche en Informatique de Toulouse, Université Paul Sabatier, 118 Route de Narbonne, F-31062, Toulouse Cedex, France | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/44155/1/10479_2005_Article_BF02248590.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF02248590 | en_US |
dc.identifier.source | Annals of Operations Research | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
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.