期刊文献+

航空产品工程网络计划关键路径算法研究 被引量:2

Network scheme critical path algorithm for aeronautic product project
在线阅读 下载PDF
导出
摘要 针对航空产品工程计划中工序作业时间小样本输入条件的特征,提出了一种基于灰色系统理论的工序作业时间预测方法。该方法根据工序作业时间历史积累的数据,建立灰色预测模型,将工程计划中具有灰色特性的不确定性工序作业时间白化为确定值。在此基础上提出了时距折算原理,将4种搭接关系和搭接时距通过时距折算模型转化为一般时距,从而将搭接型网络计划转化为一般网络计划,推导出复杂航空产品工程计划网络时间参数计算模型,并得到关键路径和关键工序判定准则。最后,给出了航空产品工程计划网络关键路径搜索算法,通过一个算例说明了算法的有效性。 Aiming at the characteristics of small sampling in aeronautic-product project scheme, a new prediction method to acquire the time limit of working process was studied based on Grey System theory. A grey prediction model was constructed according to the accumulated data in history of working procedure, and with this model the grey time limit was whitened to certain value. Based on the model, the principle of time delay conversion was proposed to transform spliced relation and time delay to general time delay. Therefore the spliced network could be changed to general network. In turn, the model calculating time-parameter of complex network plan was deduced. Furthermore, the judgment criteria for critical path and working process were obtained. Finally, the search algorithm for critical path in aeronautic-product project scheme network was presented, and the effectiveness of the algorithm was verified by an example.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2006年第2期192-197,共6页 Computer Integrated Manufacturing Systems
基金 国家863/CIMS主题资助项目(2002AA413710)。~~
关键词 搭接网络计划 关键路径 灰色预测 小样本 spliced network plan critical path gray prediction small sampling
  • 相关文献

参考文献4

二级参考文献10

共引文献114

同被引文献30

  • 1羌磊,肖田元.分布协同Bayesian优化方法求解调度问题[J].清华大学学报(自然科学版),2005,45(10):1328-1331. 被引量:2
  • 2严蔚敏,吴伟民.数据结构[M].北京:清华大学出版社,2001
  • 3高勇,苑桂萍.UGNX数控加工基础教程[M].北京:人民邮电出版社,2006.
  • 4陈松乔,肖建华,刘丽华,等.算法与数据结构(C语言版)[M].北京:清华大学出版社,北方交通大学出版社,2002.
  • 5Hobday M, Brady T. Rational V S. Soft management in complex software: lessons from flight simulation[ J]. International Journal of Innovation Management, 1998, 2 (1) : 1-43.
  • 6Malcolm D G, Roseboom J H, Clark C E, et al.. Application of technique for research and development program evaluation (PERT) [J]. Operations Research, 1959, 7(5) : 646-669.
  • 7William T M. Criticality in stochastic networks[J]. Operational Research Society Journal, 1992, 43: 353-357.
  • 8Kamburowski J. An overview of the computational complexity of the PERT shortest route and maximum flow problems in sto- chastic networks[ A ]. Andreatta G, Mason F, and Serafini P. Stochastic in Combinatorial Optimization [ C ]. Singapore: World Scientific Publishing, 1987. 187-196.
  • 9MacCrimmon K R, Ryavec C A. An analytical study of the PERT assumptions [ J]. Operations Research, 1964, 12( 1 ) : 16-37.
  • 10Perry C, Greig I D. Estimating the mean and variance of subjective distributions in PERT and decision analysis[ J]. Manage- ment Science, 1975, 21(12): 1477-1480.

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部