本文发现在GPRs搭接网络传统算法中，针对某些可分解的关键工序，通过工序的分解会产生分解悖论和咖啡时间悖论。通过对这些悖论现象的分析研究，发现其存在帕累托改进。对此，提出了两个分解优化定理及网络的分解优化方法，使网络的总工期和总时差的分布都得到了优化，为项目WBS和资源优化提供了更科学的，更充足的条件。并将该分解优化定理同流水作业原理相结合，用实例证明了该方法的可操作性，为流水作业中施工段的划分提供了科学的优化方法。
In this paper, the critical activities decomposition paradox and the total floats paradox in the traditional algorithm of GPRs multi-time difference network are found. The critical activities decomposition paradox is that the critical activity which is decomposed into two activities with FTS=0 logical relation will lead to the total duration shortened. The total floats paradox is that activities which are decomposed will increase the total float. The reasons of these two paradoxes and propose critical activities decomposition optimization theorem and total float decomposition optimization theorem are analyzed. The new methods make the total project duration and the distribution of total time of the network optimized. They can also provide more scientific and sufficient conditions for project WBS and resource optimization. In addition the division optimization theorem is combined with the flow process network in order to provide a scientific optimization method for the construction section in the flow process.
[1] Crandall K C. Project planning with precedence lead/lag factors[J]. Project Management Quarterly,1973,5(3):18-27.
[2] Elmaghraby S E. Kamburowski J. The analysis of activity networks under generalized precedence relations (GPRs)[J]. Management Science,1992,38(9):1245-1263.
[3] 刘树良,熊俊,乞建勋,等. 搭接网络中关键工序的奇异现象[J].中国管理科学, 2014,22(S1):194-198.
[4] 阚芝南,孔峰,乞建勋.搭接网络中的路长悖论及其特性研究[J].中国管理科学, 2014,22(5):121-130.
[5] 苏志雄,乞建勋,阚芝南.搭接网络的新表示方法与奇异现象研究[J].系统工程理论与实践, 2015,35(1):130-141.
[6] 钱昆润. 葛箔圃建筑施工组织与计划[M]. 南京:东南大学出版社,1989.
[7] Selinger S. Construction planning for linear projects[J].Journal of the Construction Division,1980,106(2):195-205.
[8] Harris R B, Ioannou P G. Scheduling projects with repeating activities[J]. Journal of construction engineering and management,1998,124(4):269-278.
[9] Kallantzis A, Soldatos J, Lambropoulos S. Linear versus network scheduling:A critical path comparison[J]. Journal of Construction Engineering and Management,2007,133(7):483-491.
[10] 杨冰.网络计划计算模型的统一[J].系统工程理论与实践,2002,22(3):51-55.
[11] 杨冰.搭接网络计划模型分析[J]. 北方交通大学学报,2002,26(5):84-87.
[12] 蒋根谋,熊燕线性计划方法及其应用研究田华东交通大学学报,2008,25(5):8-11.
[13] 张立辉,邹鑫,乞建勋,等. 重复性建设项目中确定关键路线的方法研究[J].运筹与管理,2015,24(1):194-198.
