基于GERTs的随机网络计划关键链识别方法  

Identifying the critical chain in the schedule of random network based on GERTs

作　　者：施骞[1] 龚婷[1] 

机构地区：[1]同济大学经济与管理学院,上海200092

出　　处：《系统工程理论与实践》2012年第7期1531-1536,共6页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(70972072);上海市重点学科资助项目(B310)

摘　　要：对随机网络计划中的关键链和相应动态参数进行了定义,提出了随机网络计划中关键链识别方法,并分析了该方法的适用范围,最后建立了随机网络计划中关键链识别的基本步骤,并给出相应的算例.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.

关 键 词：关键链 随机网络 GERTs 

分 类 号：C935[经济管理—管理学]