计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (28): 220-222.DOI: 10.3778/j.issn.1002-8331.2008.28.072

• 工程与应用 • 上一篇    下一篇

模糊关键路径的求解算法

张宏国1,王 丹2,陈志强2   

  1. 1.哈尔滨理工大学 软件学院,哈尔滨 150080
    2.哈尔滨理工大学 计算机科学与技术学院,哈尔滨 150080
  • 收稿日期:2007-11-16 修回日期:2008-01-31 出版日期:2008-10-01 发布日期:2008-10-01
  • 通讯作者: 张宏国

Algorithm for finding fuzzy critical paths

ZHANG Hong-guo1,WANG Dan2,CHEN Zhi-qiang2   

  1. 1.Software College,Harbin University of Science and Technology,Harbin 150080,China
    2.Computer Science and Technology College,Harbin University of Science and Technology,Harbin 150080,China
  • Received:2007-11-16 Revised:2008-01-31 Online:2008-10-01 Published:2008-10-01
  • Contact: ZHANG Hong-guo

摘要: 提出了一种基于P矩阵求解模糊关键路径的算法,该算法数据结构形式简单直观且易于实现。通过实例验证了算法的有效性,与其他同类算法相比具有较好的计算复杂度,该算法计算复杂度为O(n3)。

关键词: 模糊网络计划, 模糊关键路径, 算法

Abstract: Based on P matrix,a new algorithm is put forward.Data structure of the algorithm is simple and is easily implemented.The concrete example shows that the algorithm is effective.Compared with other same algorithm,this algorithm with the computational complexity O(n3) is better.

Key words: fuzzy network planning, fuzzy critical path, algorithm