重复性建设项目赶工问题  

Repetitive Construction Project Deadline Constraint Satisfaction Problem

作　　者：张立辉[1] 梁洪源[1] 

机构地区：[1]华北电力大学经济与管理学院,北京102206

出　　处：《土木工程与管理学报》2016年第3期22-29,共8页Journal of Civil Engineering and Management

基　　金：国家自然科学基金(71271081)

摘　　要：压缩正控制子工序的工期,是处理重复性建设项目赶工问题的常用手段,但这类方法将产生较大的项目总费用。本文提出了重复性建设项目赶工问题新算法。算法为项目中的正控制子工序和逆控制子工序,分别制定相应的调整方案,每一步调整将挑选出对应总费用增加率最小的方案,直至达到预定的工期,确保项目能以最小的费用实现赶工。此外,本文提供判别控制子工序类别的新方法,用以判定出控制子工序的类别。算例分析结果显示,本文算法能简便识别出各类型控制子工序,并以较小的计算量得到对应最小总费用精确解。Compressing forward controlling segment＇s duration is the common method to achieve the desired duration,however,it will have a large total project cost. A new algorithm for repetitive construction project to achieve the desired duration is proposed. The algorithm provides different scheduling adjustment plans for forward controlling segments and backward controlling segments.Every adjustment execution the plan which corresponding to the minimum total cost increase rate,until the desired duration is achieved,it can guarantee the total cost is minimum. In addition,a simple method to find the controlling segments is proposed. Example analysis shows the new algorithm can easily recognize the controlling segments,and obtain an exact solution with a small amount of calculation,meanwhile,the total cost of the optimal solution is smaller than the common algorithm.

关 键 词：重复性项目 控制子工序 项目总工期 赶工 

分 类 号：TU72[建筑科学—建筑技术科学]