SPM Network Planning Model and Its Characteristics Based on CPM Theories and Dijkstra Algorithm
QI Jian-xun · Yunchou yu guanli · 2008
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.