期刊文献+

双代号网络计划中工序机动时间传递性研究 被引量:1

Study on Activity Float Transitivity in Activity-on-Arc Network Planning
原文传递
导出
摘要 针对任意工序使用机动时间对它的前、后继工序产生影响的问题,即机动时间传递性问题,利用机动时间的几类时差,特别是前、后共用时差、双单时差和双共时差,通过对工序使用机动时间的三种方式及对前、后继工序的影响进行分析,提出基于双代号网络的标值算法,运用该算法量化了任意工序使用机动时间对整个网络中工序机动时间的影响程度和范围,并以此为基础,形成系统的分析体系。 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.
出处 《工业工程与管理》 北大核心 2009年第4期60-66,共7页 Industrial Engineering and Management
基金 国家自然科学基金项目(70671040) 教育部博士点基金资助项目(20050079008)
关键词 项目管理 机动时间 双代号网络计划 标值算法 project management float activity-on-arc network planning markvalue algorithm
  • 相关文献

参考文献15

二级参考文献46

共引文献190

同被引文献16

  • 1Demeulemeester E L, Herrlelen W S. Project scheduling[ M ]. Boston: Kluwer Academic Publishers, 2002, 17-48.
  • 2Michael D J, Kamburowski J, Stallman M On minimum dummy arc problem[J]. Operations Research, 1993, 27(2): 153-168.
  • 3Elmaghraby S E, Kamburowski J. On project representation and activity floats [ J ]. Arabian Journal of Science and Engineering, 1990, 15 : 627-637.
  • 4Elmaghraby S E. Activity nets: a guided tour through some recent developments [ J]. European Journal of Operational Research, 1995, 82: 383-408.
  • 5Elmaghraby S E. Activity networks: project planning and control by network models [ M ]. New York: John Wiley & Sons Inc., 1977.
  • 6Yakhchali S H, Ghodsypour Seyed Hassan. Computing latest starting times of activities in interval-valued networks with minimal time lags[ J]. European Journal of Operational Research, 2010, 200(3) : 874-880.
  • 7Elmaghraby S E. On criticality and sentivity in activity networks[ J]. European Journal of Operational Research, 2000, 127: 220-238.
  • 8Kastor A, Sirakoulis K. The effectiveness of resource levelling tools for resource constraint project scheduling problem[ J] International Journal of Project Management, 2009, 27 (5) : 493-500.
  • 9Z. Karaca, Onargan T. The application of critical path method (CPM) in workflow schema of marble processing plants [ J Materials and Manufacturing Processes, 2007, 22( 1 ): 37-44.
  • 10Rodder W. A generalized saddlepoint theory; its application to duality theory for linear vector optimum problems [ J ] European Journal of Operational Researh, 1977, 1 ( 1 ) : 55-59.

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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