Premium
Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations
Author(s) -
Leemis Lawrence M.,
Duggan Matthew J.,
Drew John H.,
Mallozzi Jeffrey A.,
Connell Kerry W.
Publication year - 2006
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20125
Subject(s) - path (computing) , monte carlo method , computer science , reduction (mathematics) , algorithm , distribution (mathematics) , probability distribution , series (stratigraphy) , mathematical optimization , mathematics , statistics , mathematical analysis , paleontology , geometry , biology , programming language
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