Efficient estimation of arc criticalities in stochastic activity networks

Efficient estimation of arc criticalities in stochastic activity networks

0.00 Avg rating0 Votes
Article ID: iaor1996123
Country: United States
Volume: 41
Issue: 1
Start Page Number: 58
End Page Number: 67
Publication Date: Jan 1995
Journal: Management Science
Authors:
Keywords: simulation: applications, networks: scheduling, statistics: inference, stochastic processes
Abstract:

An algorithm is described for estimating arc and path criticalities in stochastic activity networks by combining Monte Carlo simulation with exact analysis conditioned on node release times. These estimators are proved to be unbiased and to have lower variance than the corresponding standard Monte Carlo estimators. The algorithm is applied to a variety of standard and randomly generated test networks to establish that the estimators are significantly and robustly more efficient then the standard estimators when run time and statistical efficiency are properly combined.

Reviews

Required fields are marked *. Your email address will not be published.