THE COMPLETION TIME OF "PERT" NETWORKS

PERT AND CRITICAL PATH TECHNIQUES ARE ENJOYING EXCEPTIONALLY BROAD APPLICATIONS. THESE TECHNIQUES AND THEIR APPLICATIONS HAVE WITHOUT ANY DOUBT CONTRIBUTED SIGNIFICANTLY TO BETTER PLANNING, CONTROL AND GENERAL ORGANIZATION OF MANY PROGRAMS. THIS PAPER IS CONCERNED WITH A TECHNICAL IMPROVEMENT IN PERT METHODOLOGY BY INTRODUCING A NEW APPROACH TO APPROXIMATE, IN AN EFFICIENT COMPUTATIONAL WAY, THE TOTAL DURATION DISTRI- BUTION FUNCTION OF A PROGRAM. IT IS ASSUMED THAT THE ACTIVITY DURATIONS ARE INDEPENDENT RANDOM VARIABLES AND HAVE A FINITE RANGE. IN PARTICULAR, CHAPTER I CONSIDERS PERT NETWORKS AND DEALS WITH THE LOWER BOUND APPROXIMATION TO THE TOTAL DURATION DISTRIBUTION FUNCTION OF THE PROGRAM. THEN THEN USE IS MADE OF THIS APPROXIMATION AND THE CRITICAL PATH METHOD TO PROPOSE BOUNDS FOR THE DIFFERENT MOMENTS OF THE DISTRIBUTION FUNCTION. THE REPORT IS COMPLETE WITH NUMERI- CAL EXAMPLES. CHAPTER II ADAPTS THE RESULTS OF CHAPTER I TO THE CASES OF DECISION PERT NETWORKS. /AUTHOR/

  • Supplemental Notes:
    • Rept No PUB 157
  • Corporate Authors:

    University of Montreal

    Center for Research on Transportation (CRT)/CIRRELT
    P.O. Box 6128, Station Centre-ville
    Montreal, Quebec  Canada  H3C 3J7
  • Authors:
    • Robillard, P
    • Trahan, M
  • Publication Date: 1974-1

Media Info

  • Features: Figures; References; Tables;
  • Pagination: 29 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00200656
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jul 22 1974 12:00AM