Study on Application and Algorithm of the Second Critical Path in CPM Network Based on Node Slack

摘要

In order to guarantee the progress of large and complex projects, and find the second critical path of CPM network fast, efficiently and accurately on the computer, study on algorithm to solve the second critical path is taken. Firstly, from the perspective of relationships between node slack and the minimum nonzero total float, three new properties of node slack in CPM network are deeply analyzed and demonstrated on the basis of relevant theories and concepts. Secondly, a new algorithm of rapidly rinding the second critical path is designed based on node slack properties. Lastly, we take the CPM network of a large and complex project for instance to carry out empirical analysis by applying the proposed algorithm.