Overview

Towards the end of the fifties methods for planning, scheduling,and control of proj­ ects were developed on the basis that the evolution of a project can be associated with a special weighted directed graph, called activity network. In this association, the individual activities of the project correspond to the arcs, the so-called proj­ ect events (beginning or termination of activities) correspond to the nodes, and the durations of the activities correspond to the weights of the respective arcs of the directed graph. 1) Contiguous arcs are assigned to activities which succeed one another immediately. The event corresponding to a node occurs exactly at the time at which all activities which are associated with the arcs leading into the node are terminated. After the occurrence of an event all those activities are be­ gun which correspond to the arcs emanating from the respective node. This implies especially that the evolution of the project has to be uniquely determined before­ hand, that every activity and every event are realized exactly once during the exe­ cution of the project, and that ""feedback"" (corresponding to cycles in the asso­ ciated network) is not permitted. Many projects, for example most R&D projects and projects in the area of production p 1 anni ng, do not sa ti sfy the foregoi ng res tri cti ons.

Full Product Details

Author:   K. Neumann ,  U. Steinhardt
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   Softcover reprint of the original 1st ed. 1979
Volume:   172
Dimensions:   Width: 17.00cm , Height: 1.40cm , Length: 24.40cm
Weight:   0.482kg
ISBN:  

9783540097051

ISBN 10:   3540097058
Pages:   272
Publication Date:   01 October 1979
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Out of stock  
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

Summary of Assumptions.- 1 Basic Concepts.- 1.1 Directed Graphs and Activity Networks.- 1.2 GERT Networks.- 1.3 Assumptions Required for GERT Networks.- 1.4 Evaluation of GERT Networks.- 1.5 Subnetworks of GERT Networks.- 2 STEOR Networks.- 2.1 Stochastic Processes Connected with STEOR Networks.- 2.2 The MRP Method for the Evaluation of STEOR Networks.- 2.3 The Numerical Implementation of the MRP Method.- 2.4 The MASON Rule.- 2.5 Earliest and Latest Times in STEOR Networks.- 2.6 Applications.- 3 GERT Networks with Basic Element Structures.- 3.1 Nodes Which Belong Together.- 3.2 Basic Elements.- 3.3 Basic Element Structures.- 3.4 Evaluation of Admissible Basic Element Structures.- 3.5 Determination of Admissible Interior Basic Element Structures.- 3.6 Applications.- 4 Evaluation of General GERT Networks.- 4.1 Cycle Reduction.- 4.2 Evaluation of an Acyclic GERT Network N.- 4.3 Applications.- 4.4 Replacement of Non-genuine IOR Nodes.- 5 Multiple Activations of Non-STEOR Nodes.- 5.1 Generalized GERT Networks and Closed Subnetworks.- 5.2 Assumptions Required for Generalized GERT Networks.- 5.3 Evaluation of Generalized GERT Networks.- 5.4 Applications.- 6 GERT Networks with Time-dependent Arc Weights.- 6.1 Basic Concepts.- 6.2 STE0R Networks.- 6.3 GERT Networks with Basic Element Structures.- 6.4 General GERT Networks.- 7 Simulation.- 7.1 GERTS Networks and Equivalent GERT Networks.- 7.2 GERTS Networks Which Do Not Have Corresponding GERT Networks.- 7.3 Simulation of GERTS Networks.- 7.4 Generalized GERTS Networks.- 7.5 A Universal Method for Evaluating Admissible GERT Networks.- A.1 Some Formulas from Probability Theory.- A.2 Stochastic Processes.- A.3 Precise Formulation of Assumption A3.- References.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions