Technical Note—A Comparison of the Method of Bounding Distributions (MBD) and Monte Carlo Simulation for Analyzing Stochastic Acyclic Networks

Robert S. Sullivan and Jack C. Hayya
Additional contact information
Robert S. Sullivan: University of Texas, Austin, Texas
Jack C. Hayya: The Pennsylvania State University

Operations Research, 1980, vol. 28, issue 3-part-i, 614-617

Abstract: The method of bounding distributions and Monte Carlo simulation are compared for efficiency in estimating the mean and cumulative distribution of network completion time. Efficiency is measured in terms of computation time and the precision of the estimates. The results of this study indicate that simulation is more efficient than bounding distributions, and that the relative efficiency of simulation is further enhanced as networks become larger.

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.3.614 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:3-part-i:p:614-617

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().