期刊文献+

搭接网络的新表示方法与奇异现象研究 被引量:5

New representations and strange phenomenon of spliced networks
原文传递
导出
摘要 针对搭接网络,设计了新的表示方法,将工序之间的所有搭接关系(时距)都等效地用经典的关键路线法(critical path method,CPM)双代号网络表示,并且能直接运用CPM法计算搭接网络的各类时间参数,使搭接网络具有和CPM双代号网络一样的直观性和便利性,更使建工行业规定的计算程序大为简化.另外,利用搭接网络的新表示方法,发现了搭接网络中的奇异现象,例如,某些关键工序的工期缩短,总工期反而延长,而某些非关键工序的工期无论如何变动,其机动时间总保持不变,等等,为项目调度等问题的解决提出新的挑战,开拓了搭接网络在研究和应用上的新领域. Focused on spliced networks, new representations were designed, which equivalently represent all spliced relations (time lags) between activities by using classic critical path method (CPM) networks with activity-on-arc representations, and time parameters were computed by using algorithms of the CPM networks. The new representations make the spliced networks be intuitive and convenient like the CPM networks with activity-on-arc representations, and furthermore greatly simplify calculation procedures which provided by construction industry. In additional, by applying the new representations, strange phenomenon were discovered in the spliced networks, for example, the project duration will be prolonged instead of being shortened if shortening durations of some critical activities; and floats of some non-critical activities will be unchanged instead of changing no matter whether prolonging or shortening their durations; and so on. The strange phenomenon cause new challenges to solve project scheduling problems etc., and open up new field of the spliced networks in theory and application.
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2015年第1期130-141,共12页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(71171079) 江西省水安全与可持续发展研究基地
关键词 搭接网络 奇异现象 关键路线法(CPM)网络 时距 机动时间 spliced networks strange phenomenon critical path method (CPM) networks time lags floats
  • 相关文献

参考文献17

  • 1Roy B. Graphes et ordonnancement[J]. Revue Francaise de Recherche Operationelle, 1962, 25:323 326.
  • 2Elmaghraby S E. An algebra for the anMysis of generalized activity networks[J]. Management Science, 1964, 10: 494 514.
  • 3Kelley J E, Walker M R. Critical-path planning and scheduling[C]// Proceedings of Eastern Joint IRE-ACM Computer Conference, 1959: 160-173.
  • 4Demeulemeester E L, Herroelen W S. Project scheduling: A research handbook[M]. Boston/Dordrecht/London: Kluwer Academic Publishers, 2002.
  • 5Elmaghraby S E, Kamburowski J. The analysis of activity networks under generalized precedence relations (GPRs)[J]. Management Science, 1992, 38(9): 1245-1263.
  • 6曹吉明,徐伟.网络计划技术与施工组织设计[M].上海:同济大学出版社,2000.
  • 7Zhan J. Heuristics for scheduling resource-constrained projects in MPM networks[J]. European Journal of Oper- ational Research, 1994, 76(1): 192 205.
  • 8Wikum E D, Donna C L, Nemhauser C L. One-machine generalized precedence constrained scheduling prob- lems[J]. Operations Research Letters, 1994, 16:87 99.
  • 9杨冰.网络计划计算模型的统一[J].系统工程理论与实践,2002,22(3):51-55. 被引量:28
  • 10杨冰.搭接网络计划模型分析[J].北方交通大学学报,2002,26(5):84-88. 被引量:14

二级参考文献11

共引文献36

同被引文献26

引证文献5

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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