【摘要】 为寻找求解CPM网络次关键路线的一种简单算法,快速、高效、准确地找到次关键路线,确保大型复杂工程项目的进度,在相关理论和概念的基础上,着眼于整体网络的化简,深入剖析CPM网络计划中最为直观的节点时差,从节点时差与最小非零总时差的关系的角度,分析研究了节点时差的三个特性;并在此基础上提出了运用节点时差实现CPM网络的层层化简,进而快速求解次关键路线的具体步骤;最后,以某工程项目的网络图为例,进行实证分析。案例计算过程表明,在CPM网络中,利用节点时差能够快速、准确地找到大型复杂工程项目的次关键路线。更多还原

【Abstract】 In order to find a simple algorithm to solve the secondary critical path of CPM network with more efficiency,accuracy and universality,and to guarantee the progress of large and complex projects,we deeply analyze the node time difference,the most intuitive index in CPM network. The secondary critical path is proposed from the perspective of the overall network simplification. Firstly,based on relative theories and concepts,three characteristics of node time difference are analyzed on the basis of the relationship between node time difference and the minimum non-zero total float. Secondly,on this basis,specific steps of rapidly solving the secondary critical path are proposed using the node time difference. Lastly,we apply the new method to the network of a certain project to carry out empirical analysis. The case calculation progress shows that the secondary critical path of large and complex projects can be quickly and accurately found by using the node time difference in CPM network.更多还原