Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations

Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations

We develop algorithms to calculate the probability distribution of the longest path of an arbitrary stochastic activity network with continuous activity durations by three techniques: recursive Monte Carlo simulation, series‐parallel reduction, and conditioning. Examples illustrate the use of the th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Networks 2006-10, Vol.48 (3), p.143-165
Hauptverfasser: Leemis, Lawrence M., Duggan, Matthew J., Drew, John H., Mallozzi, Jeffrey A., Connell, Kerry W.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
computer algebra system
Computer science
control theory
systems
Computer systems and distributed systems. User interface
conditional probability
Exact sciences and technology
recursion
series-parallel reduction
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We develop algorithms to calculate the probability distribution of the longest path of an arbitrary stochastic activity network with continuous activity durations by three techniques: recursive Monte Carlo simulation, series‐parallel reduction, and conditioning. Examples illustrate the use of the three techniques. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(3), 143–165 2006
ISSN:0028-3045
1097-0037
DOI:10.1002/net.20125