Abstract
GERT networks all of whose nodes have OR entrance and deterministic or stochastic exit and which are called OR networks are considered. The assumption that, figuratively speaking, different walks emanating from a deterministic node do not meet anywhere in an OR network results in a certain tree structure: If we shrink all strong components of the network to one node each, then any partial network whose activities are carried out during a single project execution represents an outtree. The above assumption also permits an OR network with “deterministic degree” d to be covered by d+1 STEOR networks (that is, GERT networks all of whose nodes have exclusive-or entrance and stochastic exit).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
