SIMULATION OF PERT PROJECT COMPLETION TIMES BY STRATIFIED SAMPLING METHODS.
TEXAS A AND M RESEARCH FOUNDATION COLLEGE STATION
Pagination or Media Count:
The algorithms for computing the cumulative distribution of the completion times of PERT networks proposed by Hartley and Worthan AD-626 486 and Ringer AD-630 841 will in general only reduce the original network to a network with fewer activities. The c.d.f. of the project completion time for the reduced network will then be computed by some other method, such as Monte Carlo simulation. In this note sampling schemes for estimating this c.d.f. are discussed. A completely random sampling scheme and a sampling procedure based on stratification of activity completion times are described and compared. Author
- Operations Research