具有不精确活动周期的网络计划方法  

Network Planning Method with Imprecise Activity Durations

作　　者：张宏国[1] 徐晓飞[1] 战德臣[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《自动化学报》2008年第9期1178-1184,共7页Acta Automatica Sinica

基　　金：国家高技术研究发展计划(863计划)(2006AA04Z150)资助~~

摘　　要：具有不精确活动周期的网络图时间参数计算和活动关键性判别问题是非常困难的问题,过去一直没有完全满意的解决方法.因此,提出了新的多项式算法确定通用网络中时间参数的取值区间,并根据活动的浮动时间来判断活动的关键性.最后,给出了求解案例,并把这些结果扩展到具有模糊活动周期的网络图中。The problems of computing the time parameters and evaluating criticality of activities in networks with imprecise activity durations are very difficult and have never been solved in a fully satisfactory manner in the past. So, the new polynomial algorithms for determining the intervals of the time parameters in general networks are proposed, and the criticality of activities can be evaluated by their floats. Finally, a solvable case is present, and then the results are extended to networks with fuzzy activity durations.

关 键 词：项目计划 网络计划方法 不精确活动周期 关键活动 关键路径 

分 类 号：TH166[机械工程—机械制造及自动化]