具有时间转换约束项目网络的时差分析

中国管理科学 ›› 2013, Vol. ›› Issue (1): 134-141.

具有时间转换约束项目网络的时差分析

李星梅¹, 张倩¹, 乞建勋¹, 赵新超²

1. 华北电力大学经济与管理学院, 北京 102206;
2. 北京邮电大学理学院, 北京 100876

收稿日期:2011-10-01 修回日期:2012-05-09 出版日期:2013-02-28 发布日期:2013-02-26
基金资助:
国家自然科学基金资助项目(71171079,61105127);中央高校基本科研经费资助项目(11QR36)

The Analysis of the Float in Project Network with Time-Constrained

LI Xing-mei¹, ZHANG Qian¹, QI Jian-xun¹, ZHAO Xin-chao²

1. School of Business, North China Electric Power University, Beijing 102206, China;
2. School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2011-10-01 Revised:2012-05-09 Online:2013-02-28 Published:2013-02-26

摘要/Abstract

摘要： 在传统的网络计划模型中,当所有的紧前工序结束后,当前工序就能够马上开始。但在实践过程中,由于许多工序会受到开始时间的约束,因此工序很少能在满足优先关系约束后的任意时刻开始,而具有时间转换约束的网络则能很好地描述此类问题。本文主要研究在时间转换约束下,不同类型的工序在网络中的时间特性变化情况,并在现有研究基础上,将网络中工序的时间参数由传统的算法转换成具有时间转换约束的时间参数,提出新的机动时间计算公式。最后以案例的形式分析比较传统网络与具有时间转换约束网络的区别,从而体现时间转换约束网络模型的实践价值。

关键词: 网络计划技术, 时间转换约束, 机动时间

Abstract: In the traditional model of network planning, when all the immediate predecessor activities come to an end, the current activity can start in no time. But in the real practice, a large quantity of activities will be restricted by the start time, seldom activities can start at any time under the satisfaction of meeting the precedence relations constraints. Network with time-constrained is a very good description of these issues. The main objective of this paper is to study how float characteristics of different activities in the network change under the time-constrained. Based on the previous work, the time parameter of activities in network can be changed from traditional algorithm into time parameter with time-constrained. Finally, the differences between traditional network and network with time-constrained are analyzed. The analysis results reflect the practical value of the time-constrained model.

Key words: network planning technique, time-constrained, float

中图分类号:

TB114.1

李星梅, 张倩, 乞建勋, 赵新超. 具有时间转换约束项目网络的时差分析[J]. 中国管理科学, 2013, (1): 134-141.

LI Xing-mei, ZHANG Qian, QI Jian-xun, ZHAO Xin-chao. The Analysis of the Float in Project Network with Time-Constrained[J]. Chinese Journal of Management Science, 2013, (1): 134-141.

参考文献

[1] 王雪青, 郭留洋, 符桃. 基于关键链技术的工程项目进度规划问题研究 [J]. 河北工业大学学报, 2005, 34(6):20-23.
[2] 徐哲, 王黎黎. 基于关键链技术的项目进度管理研究综述 [J]. 北京航空航天大学学报, 2011, 24(2): 54-59.
[3] Fatemi Ghomi S M T, Teimouri E. Path critical index and activity critical index in PERT networks [J]. European Journal of Operational Research, 2002, 141(1): 147-152.
[4] Sedeño-Noda A, Alcaide López de Pablo D, González-Martín C. A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows [J]. European Journal of Operational Research, 2009, 196(1): 140-154.
[5] 王强, 李星梅, 乞建勋. 双代号网络中虚工序对时差计算公式的影响与修正 [J]. 系统工程理论与实践, 2008, 28(6): 106-114.
[6] 马国丰, 尤建新. 关键链项目群进度管理的定量分析[J]. 系统工程理论与实践, 2007, 27(9): 54-60.
[7] Elmaghraby S E. Activity nets: a guided tour through some recent developments [J]. European Journal of Operational Research, 1995, 82(3): 383-408.
[8] Chen Y L, Rinks D, Tang K. Critical path in an activity network with time-switch constraints[J]. European Journal of Operational Research, 1997, 100: 122-133.
[9] Alcaide D, Chu C B, Kats V, Levener K, Sierksma G. Cyclic multiple-robot scheduling with time-window constraints using a critical path approach [J]. European Journal of Operational Research, 2007, 177(1):147-162.
[10] Kats V, Lei L, Levner E. Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints [J]. European Journal of Operational Research, 2008, 187(3): 1196-1211.
[11] Yang H H, Chen Y L. Finding the critical path in an activity network with time-switch constraints [J]. European Journal of Operational Research, 2000, 120(3): 603-613.
[12] Guerriero F, Talarico L. A solution approach to find the critical path in a time-constrained activity network [J]. Computer & Operations Research, 2010, 37(9):1557-1569.
[13] Vanhoucke M. New computational results for the discrete time/cost trade-off problem with time-switch constraints [J]. European Journal of Operational Research, 2005, 165(2): 359-374.
[14] 张静文,徐渝. 具有时间转换约束的项目网络分析方法研究[J]. 系统工程理论与实践, 2005, 25(7): 26-34.
[15] 张静文,徐渝,何正文. 多种费用下具有时间转换约束的工期费用均衡项目调度研究[J]. 运筹与管理, 2009, 18(3): 78-84.
[16] 张静文,徐渝,何正文,柴国荣. 项目调度中的时间-费用权衡问题研究综述[J]. 管理工程学报, 2007, 21(1): 92-97.