Abstract
The network with generalized precedence relations (GPRs) is very useful for project managers. However, it is limited to be used widely in real projects due to its very complex graphical representation which makes it difficult to be understood by the project managers and practitioners. Therefore, some methods are proposed to make the GPRs model structure more clear and concise, which include the conditions of adding backward arcs and the methods of eliminating cycles. And then, an illustrative example manifests that the improved GPRs model is helpful for searching and discriminating all network paths which can be searched by the Depth-First-Search algorithm efficiently.
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.
