On simulating nondeterministic stochastic activity networks

Simple item page
dc.creatorBarbosa, Valmir C.
dc.creatorFerreira, Fernando M. L.
dc.creatorKling, Daniel V.
dc.creatorLopes, Eduardo
dc.creatorProtti, Fabio
dc.creatorSchmitz, Eber A.
dc.date2006-12-28
dc.date2007-03-28
dc.date.accessioned2026-07-07T12:54:35Z
dc.date.available2026-07-07T12:54:35Z
dc.descriptionIn this work we deal with a mechanism for process simulation called a NonDeterministic Stochastic Activity Network (NDSAN). An NDSAN consists basically of a set of activities along with precedence relations involving these activities, which determine their order of execution. Activity durations are stochastic, given by continuous, nonnegative random variables. The nondeterministic behavior of an NDSAN is based on two additional possibilities: (i) by associating choice probabilities with groups of activities, some branches of execution may not be taken; (ii) by allowing iterated executions of groups of activities according to predetermined probabilities, the number of times an activity must be executed is not determined a priori. These properties lead to a rich variety of activity networks, capable of modeling many real situations in process engineering, project design, and troubleshooting. We describe a recursive simulation algorithm for NDSANs, whose repeated execution produces a close approximation to the probability distribution of the completion time of the entire network. We also report on real-world case studies.
dc.identifierhttps://arxiv.org/abs/cs/0612140
dc.identifierhttp://arxiv.org/abs/cs/0612140
dc.identifierEuropean Journal of Operational Research 198 (2009), 266-274
dc.identifierdoi:10.1016/j.ejor.2008.06.010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223982
dc.subjectDiscrete Mathematics
dc.titleOn simulating nondeterministic stochastic activity networks
dc.typetext

Files

Collections

arXiv