Abstract
GERT networks which only contain STEOR nodes can easily be evaluated in principle as we have seen in chapter 2. Difficulties, however, are caused by nodes with deterministic exit and, above all, by nodes with AND entrance or with IOR entrance. In this chapter we treat GERT networks which, on one hand, contain non-STEOR nodes but which, on the other hand, are still relatively easily evaluated, and for which, as with STEOR networks, exactly one target event occurs with probability one during each project execution. It is obvious that these two requirements entail certain restrictions placed on the structure of the corresponding GERT networks. It proves to be expedient in this context to admit non-STEOR nodes only within special reducible subnetworks2) the so-called basic element structures. After having evaluated these basic element structures, we obtain a STEOR network to which the MRP method treated in sections 2.2 and 2.3 may be applied.
For this chapter we refer to FIX [7]. The basic element structures defined in FIX [7] are called “pre-basic element structures” in this monograph, whereas now basic element structures have to satisfy additional conditions. The evaluation method presented in FIX [7], however, constructs basic element structures within the meaning of our definition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Neumann, K., Steinhardt, U. (1979). GERT Networks with Basic Element Structures. In: GERT Networks and the Time-Oriented Evaluation of Projects. Lecture Notes in Economics and Mathematical Systems, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95363-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-95363-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09705-1
Online ISBN: 978-3-642-95363-7
eBook Packages: Springer Book Archive