Feasibility Identification for Networks with Generalized Precedence Relations (GPRs)

Network with Generalized Precedence Relations (GPRs) is a very important model in network planning technology which is the core technology of project management software. The most important problem should be solved first is to identify the network feasibility under GPRs in project planning phase, which determines whether its successive works can be processed successfully or not. This paper puts forward the definition of parallel subnetwork and studies the methods of its identification and feasibility discrimination. And then, we propose distinguishing methods for network feasibility in an acyclic network with GPRs, study the identifying methods for subprojects and GPRs arcs which need to be adjusted when the network is infeasible. The analysis of time complexity and computational example manifests that the proposed algorithm is feasible and effective in practice.