期刊文献+

网络计划的网络时差模型及其最值 被引量:1

Network float model of network planning and its maximum and minimum
原文传递
导出
摘要 网络计划的网络时差表示各工序实际可用的机动时间的总和(不是理论上机动时间的简单加总),即CPM网络计划的总机动时间,它决定着在总工期不变的前提下,所有工序实际可以达到的最大工期的总和,与工程项目的成本密切相关.网络时差是变量,与各工序的时间参数相关,说明可以通过调整工序的时间参数决定该时差的取值,进而实现成本优化,但目前还无法确定其变动幅度.首先从新的角度分析了网络时差的含义;然后,在此基础上建立了求解网络时差的模型,确定了网络时差的变动范围(即确定其最大值和最小值),以及为了实现网络时差的最值各工序需满足的时间参数值;最后,通过算例阐述其应用. Network float of network planning denotes sum of floats which could be consumed practically by each activity,and isn't the simple sum of floats in theory.Network float determines sum of the maximal reachable durations of all activities in pracrice under condition of fixed total duration,and is correlative close to cost of project engineering.The network float is variable,and is correlative to time parameters of each activity.It illuminates that value of the float could be decided by adjusting time parameters of activities,and then realizes optimization of cost;but variational extent of the float has not been confirmed now.In this paper,firstly,meanings of network float is analyzed from new visual angle;secondly,model of computing network float is founded base on above meanings,variational extent of the float viz.maximum and minimum are confirmed,and time parameters of each activity which should be satisfied for obtaining the maximun and minimum of network float are also confirmed;finally,case study is used to expound the application.
出处 《武汉大学学报(工学版)》 CAS CSCD 北大核心 2011年第6期812-816,共5页 Engineering Journal of Wuhan University
关键词 网络计划 网络时差模型 网络时差 network planning network float model network float
  • 相关文献

参考文献12

  • 1Demeulemeester E L, Herrlelen W S. Project Schedu- ling [M]. Boston.. Kluwer Academic Publishers, 2002, 17-48.
  • 2Michael D J, Kamburowski J, Stallman M. On mini- mum dummy arc problem [J]. Operations Research, 1993,27(2) : 153-168.
  • 3Elmaghraby S E, Kamburowski J. On project repre- sentation 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.
  • 6王强,李星梅,乞建勋.双代号网络图中虚工序对时差计算公式的影响与修正[J].系统工程理论与实践,2008,28(6):106-114. 被引量:6
  • 7王佳,李星梅,乞建勋.基于机动时间的平行序链顺序优化算法设计[J].系统工程学报,2008,23(4):455-461. 被引量:4
  • 8Yakhchali S H, Ghodsypour Seyed Hassan. Compu-ring latest starting times of activities in interval-valued networks with minimal time lags [J]. European Jour- nal of Operational Research, 2010,200(3):874-880.
  • 9Elmaghraby S E. On criticality and sentivity in activity networks [J]. European Journal of Operational Re- search, 2000,127 : 220-238.
  • 10Kastor, Sirakou!is K. The effectiveness of resource levelling tools for resource constraint project schedu- ling problem [J]. International Journal of Project Management, 2009,27 (5) : 493-500.

二级参考文献17

共引文献6

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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