SIMULATION OF PERT PROJECT COMPLETION TIMES BY STRATIFIED SAMPLING METHODS.

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)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1966
Accession Number
AD0637830

Entities

People

  • Larry J. Ringer

Organizations

  • Texas A&M University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Collecting Methods
  • Data Science
  • Information Science
  • Mathematics
  • Monte Carlo Method
  • Sampling
  • Simulations
  • Statistical Algorithms
  • Statistical Sampling
  • Stratification

Readers

  • Operations Research
  • Statistical inference.