首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于GERTs的随机网络计划关键链识别方法
引用本文:施骞,龚婷.基于GERTs的随机网络计划关键链识别方法[J].系统工程理论与实践,2012,32(7):1531-1536.
作者姓名:施骞  龚婷
作者单位:同济大学 经济与管理学院, 上海 200092
基金项目:国家自然科学基金(70972072);上海市重点学科资助项目(B310)
摘    要:对随机网络计划中的关键链和相应动态参数进行了定义, 提出了随机网络计划中关键链识别方法, 并分析了该方法的适用范围, 最后建立了随机网络计划中关键链识别的基本步骤, 并给出相应的算例.

关 键 词:关键链  随机网络  GERTs  
收稿时间:2010-04-20

Identifying the critical chain in the schedule of random network based on GERTs
SHI Qian , GONG Ting.Identifying the critical chain in the schedule of random network based on GERTs[J].Systems Engineering —Theory & Practice,2012,32(7):1531-1536.
Authors:SHI Qian  GONG Ting
Institution:School of Economics and Management, Tongji University, Shanghai 200092, China
Abstract:Following the definition of the critical chain and its parameters in the schedule of random network,the authors have put forward the methodology on how to identify the critical chain of random network.Furthermore,the scope of the application of this methodology has also been clarified.Finally, the authors have set up the main steps of identifying the critical chain of random network.An example has also been given to show how to use this method.
Keywords:critical chain  random network  GERTs
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《系统工程理论与实践》浏览原始摘要信息
点击此处可从《系统工程理论与实践》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号