TITLE

A STATISTICAL THEORY FOR PERT IN WHICH COMPLETION TIMES OF ACTIVITIES ARE INTER-DEPENDENT

AUTHOR(S)
Ringer, Larry J.
PUB. DATE
July 1971
SOURCE
Management Science;Jul1971, Vol. 17 Issue 11, p717
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper presents a method for taking into account dependency among certain activities in PERT networks. The method presented can be used with the reduction algorithm presented by Hartley and Wortham [1]. The addition of dependency among the completion times for certain types of activities should be a valuable aid in sensitivity analyses of PERT networks.
ACCESSION #
7019399

 

Related Articles

  • L'Histoire de Grandeur et de la Décadence de la Méthode PERT. Vazsonyi, Andrew // Management Science;Apr1970, Vol. 16 Issue 8, pB-449 

    The article presents the author's views on means of measuring and controlling development progress in the United States. First, the author discusses the terms PERT (Program Evaluation and Research Task) CPM (Critical Path Analysis). The author references a related document written by Andrew...

  • "Network Planning, the Continuing Evolution" Sobczak, Thomas V. // Academy of Management Proceedings (00650668);1963, p96 

    The article looks at the incremental development of network planning in flow charts in the United States. The impact of Line of Balance (LOB) on production process of raw materials is considered. The use of acronyms as a result of breakthroughs is mentioned. The correlation between LOB and...

  • PERT AND THE AUDITOR. Burgber, Peter H. // Accounting Review;Jan1964, Vol. 39 Issue 1, p103 

    In July, 1962, all companies working on research and development contracts for the U.S. Department of Defense or the U.S. National Aeronautics and Space Administration were advised by those agencies that they would be expected, in the future to employ (PERT) in planning and controlling their...

  • SOME PROPERTIES OF SCHEDULES FOR LARGE PROJECTS WITH LIMITED RESOURCES. Wiest, Jerome D. // Operations Research;May/Jun64, Vol. 12 Issue 3, p395 

    The Critical Path Method, PERT, and related techniques that make use of arrow diagrams for scheduling large projects implicitly assume that unlimited resources are available for assignment to project activities. When resources are limited, however, the usual concepts of 'critical path' and 'job...

  • DISTRIBUTION OF THE TIME THROUGH A DIRECTED, ACYCLIC NETWORK. Martin, J. J. // Operations Research;Jan/Feb65, Vol. 13 Issue 1, p46 

    Let there be associated with each arc of a directed, acyclic network a random variable, conveniently referred to as the arc passage time. It is assumed that the arc passage times are independent and have a finite range. A method is presented for the efficient computation of the density function...

  • CHAPTER 6: Scheduling Project Work. Lewis, James P. // Fundamentals of Project Management;2007, p69 

    Chapter 6 of the book "Fundamentals of Project Management" is presented. It discusses the principles of scheduling within the context of project management. The use of Critical Path Method (CPM) and Program Evaluation and Review Technique (PERT) is demonstrated. Incorporating the concept of Work...

  • Is Critical Chain Project Management Really a Novel Technique? Špundak, Mario; Fertalj, Krešimir; Kalpić, Damir // Central European Conference on Information & Intelligent Systems;2008, p48 

    In the growing discipline of Project Management (PM), the techniques used for project planning mainly include methods developed at dawn of modern PM back in 1950's. Therefore, they are influenced by Operational Research and are founded on Program Evaluation and Review Technique (PERT) or on...

  • EARLIEST FINISH TIME.  // Encyclopedia of Operations Research & Management Science;2001, p221 

    A definition of the term "earliest finish time" is presented. As described in a project network, it refers to the earliest possible time an activity can be completed without reducing the duration of any of the preceding activities. It is the sum of the duration of the earliest start time for the...

  • TIME-COST OPTIMIZATION MODEL FOB DETERMINISTIC NETWORK PROJECTS. Ben-Yair, Avner; Laslo, Zohar; Greenberg, Doron; Golenko-Ginzburg, Dimitri // Journal of Applied Quantitative Methods;2008, Vol. 3 Issue 4, p339 

    A deterministic PERT activity-on-arc network G(N, A) with logical operation "AND" at the event's receiver and "MUST FOLLOW" at the event's emitter, is considered. Each activity (i, j) ∊ A entering the model can be operated within several deterministic durations tij depending on the...

Share

Read the Article

Courtesy of NEW JERSEY STATE LIBRARY

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics