基于STPN的项目进度规划

Project Scheduling Based on STPN

通过将网络计划图映射为Petri网形式,在Petri网上求解完成工序所需时间不确定时的网络时间与关键路线,给出相对于传统的计划评审法,该方法工序时间可以为任意分布,且较容易通过多次模拟得出最优解的经验分布,与PERT仅仅给出数学期望与方差相比结果更丰富。最后探讨了基于STPN的时间-资源优化求解算法,其计算时间仅为O(nk),其中n为网络节点数,k为网络结点之间的连接数,其算法比线性规划方法更有效率。

By the network plan chart mapping to the form of Petri nets, the network time of the critical path with uncertain activity time was found on Petri nets. Compared with the traditional Program evaluation and review technique, the method could deal with any distribution of activity time while the experience distribution of the optimal solution could be easily reached by a number of simulations. Finally the algorithm of time - resource optimization problem based on STPN was explored, the computation time of which was only O（nk） , n for the network nodes number, k for the network connection number between nodes. The algorithm was more efficient than linear programming methods.