弱化PERT网关键路径算法研究  

Research on Algorithms for Critical Path of PERT Network with Lowering Conditions

作　　者：申龙青[1] 余剑峰[1] 杨海成[1] 

机构地区：[1]西北工业大学现代设计与集成制造技术教育部重点实验室,陕西西安710072

出　　处：《计算机应用研究》2006年第1期31-33,共3页Application Research of Computers

基　　金：国家"863"计划资助项目(2002AA413710)

摘　　要：航空产品本身具有高复杂性、协同性要求严格的特征,同时,传统PERT模型已知条件难以充分获取,而且其关键线路求解算法涉及概率论和数理统计知识而难以实现计算机求解。引入灰色理论思想,将传统PERT网络计划已知条件弱化,探索出适合计算机求解的关键线路算法,算法适应国内航空产品项目特征,适合大型复杂航空产品项目计算机求解,并在典型航空产品项目得到应用验证。While resolving the problem of complex aeronautic product project, the algorithm based on traditional PERT network plan faces the problem that it＇ s hard to obtain sufficient condition and the algorithm is involved with the theory of probability and mathematical statistics, so it＇ s difficult to be solved by the tool of computer. Using the idea of gray theory, the paper lowers the traditional condition of PERT network plan and analyzes the algorithm of crucial path which is adapting to computer. The algorithm adapts to the characteristic of civil aeronautic product project and the computing of complex aeronautic product project.

关 键 词：计划评审网络 关键路径 灰色理论 航空产品项目 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]