EXPECTED CRITICAL PATH LENGTHS IN PERT NETWORKS

Abstract

A feasible computational method that seems to yield a fairly good approximation to the expected duration time of a project whose individual job times are random variable is described. Another possible area of application of this method would be to communication net orks whose components are subject to random delay times.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1962
Accession Number
AD0274597

Entities

People

  • D. R. Fulkerson

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Air Force
  • Communication Networks
  • Computational Science
  • Computations
  • Dynamic Programming
  • Equations
  • Inequalities
  • Networks
  • Notation
  • Pert
  • Probability
  • Probability Distributions
  • Random Variables
  • Terminals
  • United States

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Instructional Design and Training Evaluation.
  • Operations Research