SIMULATION OF PERT PROJECT COMPLETION TIMES BY STRATIFIED SAMPLING METHODS.

reportActive / Technical Report | Accession Number: AD0637830 | Need Help?

Abstract:

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

Author(s):
Ringer, Larry J.
Author Organization(s):
TEXAS A AND M RESEARCH FOUNDATION COLLEGE STATION
Descriptive Note:
Technical rept.
Pagination:
0011

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TR-3, AROD-4721:4
Contract/Grant Number(s):
DA-31-124-ARO(D)-282
Project Number(s):
DA-20014501B14C
Monitor Series:
4721:4
 Subject Terms
Joint Capability Areas:
JCA_6.1_Information Transport; JCA_6_Net Centric
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*OPERATIONS RESEARCH, MANAGEMENT ENGINEERING, NETWORKS, TIME, MONTE CARLO METHOD, ELECTRICAL NETWORKS, DISTRIBUTION, SAMPLING, STATISTICAL ANALYSIS
Field(s)/Group(s):
Operations Research
Keyword(s):
CRITICAL PATH METHOD, PERT
Report Date:
1965 Jan 01