统筹图的关键线路计算方法  

On the Calculations for the Critical Path in Overall Planning Chart

作　　者：许宁 XU Ning(College of Politics,National Defence University of PLA,Shanghai 201602,China)

机构地区：[1]国防大学政治学院,上海201602

出　　处：《常熟理工学院学报》2020年第2期79-86,共8页Journal of Changshu Institute of Technology

基　　金：国防大学政治学院资助项目(17ZY02-08)。

摘　　要：运用求最短路的Dijkstra算法、最小支撑树的破圈法等思想,结合统筹图的特征,给出求统筹图关键线路的两种图上作业法:统筹图的Dijkstra标记法和破圈法.This paper concerns the calculations for the critical path in overall planning chart.Combining the overall planning chart and algorithm for solving the shortest path and minimum spanning tree problems,we present two graphically operating methods to obtain the critical path in overall planning chart including Dijkstra’s label setting method and the method of broken circle.

关 键 词：统筹图 关键线路 Dijkstra标记法 破圈法 

分 类 号：O223[理学—运筹学与控制论]