期刊文献+

对具有时间转换约束网络模型的特性研究 被引量:3

Research on the feature in the activity network model with time-switch constraints
下载PDF
导出
摘要 传统的网络技术规定工序可以在任意时刻开始,但是在现实的工程中由于时间转换约束的存在,活动很少在满足优先关系约束后在任意时刻开始.本文主要是在时间转换约束模型网络的基础上,提出时间转换约束对网络关键线路的影响,并对网络的传递性进行了分析,得出传递量推算过程.最后通过算例验证了其准确性. Traditional network technology assumes that activities can begin at any time. Due to the time-switch constraints, however, it is impossible for activities to start at any time satisfying the precedence relations. Based on the activity network model with time-switch constraints, the impact of the time-switch constraints on the critical path is presented. This paper analyzes the network transitivity, and then proposes the calculation procedure of transmission capacity. Finally, feasibility and validity of the conclusion are illuminated by an example.
出处 《系统工程学报》 CSCD 北大核心 2013年第3期394-402,共9页 Journal of Systems Engineering
基金 国家自然科学基金资助项目(71171079 61105127) 中央高校基本科研经费资助项目(11QR36)
关键词 网络 时间转换约束 关键路线 传递性 network time-switch constraints critical path transitivity
  • 相关文献

参考文献13

二级参考文献106

共引文献89

同被引文献34

  • 1彭武良,王成恩.关键链项目调度模型及遗传算法求解[J].系统工程学报,2010,25(1):123-131. 被引量:33
  • 2贾海红,苏志雄,李星梅.工序机动时间的传递性和稳定性分析[J].中国管理科学,2008,16(S1):147-151. 被引量:2
  • 3徐长盛,谢立.关键路径算法的面向对象解决[J].计算机应用研究,2005,22(4):96-97. 被引量:5
  • 4Guerriero 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.
  • 5Yang H H, Chen Y L. Finding the critical path in an activity network with time-switch constraints[J]. Euro- pean Journal of Operational Research, 2000, 120(3): 603-613.
  • 6Parikh S C, Jewell W S. Decomposition of project net- works[J]. Management Science, 1965, 11(3): 444- 459.
  • 7李敏芝.一种处理PERT的计算机方法[J].系统工程与电子技术,1983,(8):60-64.
  • 8Muller J H, Spinrad J. Incremental modular decompo- sition[J]. Journal of the ACM, 1989, 36(1): 1-19.
  • 9Obreque C, Donoso M, Gutiorrez G, et al. A branch and cut algorithm for the hierarchical network design problem[J]. European Journal of Operational Re- search, 2010, 200(1): 28-35.
  • 10Obreque C, Marianov V, Rios M. Optimal design of hierarchical networks with Hee main path extremes[J]. Operations Research Letters, 2008, 36 (3) : 366- 371.

引证文献3

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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