基于CPM原理和Dijkstra算法的SPM网络计划模型及性质

SPM Network Planning Model and Its Characteristics Based on CPM Theories and Dijkstra Algorithm

CPM(关键路线法)网络计划适用于分析工序间存在严格紧前关系(任意工序只能在它的所有紧前工序都结束时才能开始)的进度计划。针对工序间不存在严格紧前关系(任意工序只要其紧前工序中的一个结束它就可以开始)的进度计划,以CPM原理和Dijkstra算法为基础,提出SPM(最短路线法)网络计划以及拟机动时间概念,根据不同的建模原理,建立了两个SPM网络计划模型,并给出了其建立方法以及各模型拟机动时间的求法,分析了每个模型的性质,最后通过算例对其中的一类模型进行了验证。

The CPM （critical path method） network planning is suitable for the planning with strict precedence relation （an activity can only start if all its predecessor activities are completed）. In view of the network planning without strict precedence relation （an activity can start if one of predecessor activities is completed）, the SPM （ shortest path method） network planning and fitting activity floats are provided based on CPM theories and Dijkstra algorithm. According to different theories of model construction, two types of SPM network planning model are set up. Furthermore, the process of different model constructions and fitting activity floats＇ are proposed, and the characteristics of every model are analyzed. Finally, an example is given to illustrate the validity of one of the models.