TITLE

THE THEORY OF NETWORKS AND MANAGEMENT SCIENCE: PART II

AUTHOR(S)
Elmaghraby, Salah E.
PUB. DATE
October 1970
SOURCE
Management Science;Oct70, Vol. 17 Issue 2, pB-54
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The article focuses on the critical path method (CPM), an activity network in which the duration of each activity is a fixed constant. A brief overview of the precedence relationship among activities and their duration is presented, and several methods for analyzing activity networks are discussed. The Program Evaluation and Review Technique (PERT) and some assumptions and simplifications utilized by the approach are also outlined. Aspects of the theory of networks and several network models are presented.
ACCESSION #
7122530

 

Related Articles

  • AN ALGEBRA FOR THE ANALYSIS OF GENERALIZED ACTIVITY NETWORKS. Elmaghraby, Salah E. // Management Science;Apr1964, Vol. 10 Issue 3, p494 

    This paper generalizes the approach of activity networks, exemplified by PERT and CPM, to networks in which activates and events occur probabilistically and contain logical relationships of a more complicated nature. For example, from a specific event some activities are undertaken with...

  • A new approach based on the surrogating method in the project time compression problems. Bidhandi, Hadi Mohammadi // Annals of Operations Research;Mar2006, Vol. 143 Issue 1, p237 

    This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of...

  • A NOTE ON PERT TIMES. Sasieni, M. W. // Management Science;Dec1986, Vol. 32 Issue 12, p1652 

    The article discusses a verification of the PERT formula, which is used for the estimation of the mean task time in program evaluation and review techniques. The author comments on the assumption that the Pert Time equation is derived from the beta distribution in probability theory. It is...

  • ADVANCED NETWORK TECHNIQUES. O'Brien, James J. // SAM Advanced Management Journal (00360805);Fall69, Vol. 34 Issue 4, p77 

    Presents information on advanced techniques for management, such as the critical path method (CPM) and the program evaluation and review technique (PERT). Developers of CPM; Adoption of PERT by the aerospace industry; Information on some network variations.

  • SOME NOTES ON THE SIMILARITY OF THREE MANAGEMENT SCIENCE MODELS AND THEIR ANALYSIS BY CONNECTIVITY MATRIX TECHNIQUES. Steinberg, Alan W. // Management Science;Jan1963, Vol. 9 Issue 2, p341 

    Certain Properties of Connectivity Matrices are noted to be similarly applicable to Three Management Science Models which have hitherto been investigated as independent structures: (1) PERT Network Analysis; (2) Parts Explosion Techniques; and (3) Business System Data Flow Analysis. These...

  • Determining the K Most Critical Paths in PERT Networks. Dodin, Bajis // Operations Research;Jul/Aug84, Vol. 32 Issue 4, p859 

    A fundamental problem in PERT networks is to identify a project's critical paths and its critical activities. In this paper we define the criticality index of a path as the probability that the duration of the path is greater than or equal to the duration of every other path in the network and...

  • ANOTHER LOOK AT THE PERT ASSUMPTIONS. Kotiah, T. C. T.; Wallace, N. D. // Management Science;Sep73, Vol. 20 Issue 1, p44 

    A maximum entropy approach leads to a truncated normal distribution for the activity time in PERT analysis. Three different methods of fit are discussed, and a comparison with the standard assumption of a Beta distribution is made. The results suggest new ways of performing the PERT analysis.

  • RESOURCE ALLOCATION IN A PERT NETWORK UNDER CONTINUOUS ACTIVITY TIME-COST FUNCTIONS. Berman, E. B. // Management Science;Jul1964, Vol. 10 Issue 4, p734 

    This paper describes a conceptual model which allocates resources in a PERT network, the activities of which are subject to continuous concave-upward time-cost functions, in such a way as to achieve a minimum cost solution for a given completion date for the program described by the network. A...

  • DYNAMIC PROGRAMMING MODELS OF THE NONSERIAL CRITICAL PATH-COST PROBLEM. Esogbue, Augustine O.; Marks, Barry R. // Management Science;Oct77, Vol. 24 Issue 2, p200 

    One of the major contributions to the planning and management of Research and Development organizations is the evolution of methods for dealing with PERT-Cost or CPM-Cost problems. Classically however, variations of the critical path-cost (CPM-Cost) problem, arising when different cost duration...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics