双代号网络计划中工序机动时间传递性研究  

Study on Activity Float Transitivity in Activity-on-Arc Network Planning

作　　者：苏志雄[1] 李星梅[1] 乞建勋[1] 

机构地区：[1]华北电力大学工商管理学院,北京102206

出　　处：《工业工程与管理》2009年第4期60-66,共7页Industrial Engineering and Management

基　　金：国家自然科学基金项目(70671040);教育部博士点基金资助项目(20050079008)

摘　　要：针对任意工序使用机动时间对它的前、后继工序产生影响的问题,即机动时间传递性问题,利用机动时间的几类时差,特别是前、后共用时差、双单时差和双共时差,通过对工序使用机动时间的三种方式及对前、后继工序的影响进行分析,提出基于双代号网络的标值算法,运用该算法量化了任意工序使用机动时间对整个网络中工序机动时间的影响程度和范围,并以此为基础,形成系统的分析体系。The study of activity float properties is the basis of scientific planning and controlling for project. Aiming at the problem, an arbitrary activity having consumed float will affect float of both preceding and succeeding activities, i. e. , activity float transitivity. Through analyzing the three forms of floating time and the affection to both preceding and succeeding activities of an activity floats consumed, mark-value algorithm based on Activity-on-Arc Network is designed. In view of the fact that an arbitrary activity consuming float will affect float of other activities in the whole network, by mark-value algorithm, the degree and scope affected is proposed in quantity. On the basis of it, systemic analysis system is formed. Furthermore, the study of activity float transitivity makes use of several types of float, especially Forward Common Float, Backward Common Float, Forward-backward Single Float and Forward-backward Common Float.

关 键 词：项目管理 机动时间 双代号网络计划 标值算法 

分 类 号：TB114.1[理学—运筹学与控制论]