Construction planners face the decisions of selecting appropriate resources, including crew sizes, equipment, methods and technologies, to perform the tasks of a construction project. In general, there is a trade-off between time and cost to complete a task - the less expensive the resources, the longer it takes. Using Critical Path Method (CPM) techniques, the overall project cost can be reduced by using less expensive resources for non-critical activities without impacting the duration. Furthermore, planners need to adjust the resource selections to shorten or lengthen the project duration. Finding the optimal decisions is difficult and time-consuming considering the numbers of permutations involved. For example, a CPM network with only eight activities, each with two options, will have 28 alternatives. For large problems, exhaustive enumeration is not economically feasible even with very fast computers. This paper presents a new algorithm using linear and integer programming to obtain optimal resource ...
[1]
Nicolai Siemens.
A Simple CPM Time-Cost Tradeoff Algorithm
,
1971
.
[2]
J W Fondahl,et al.
A non-computer approach to the critical path method
,
1962
.
[3]
William Prager.
A Structural Method of Computing Project Cost Polygons
,
1963
.
[4]
James E. Kelley,et al.
Critical-Path Planning and Scheduling: Mathematical Basis
,
1961
.
[5]
James H. Patterson,et al.
A Horizon-Varying, Zero-One Approach to Project Scheduling
,
1974
.
[6]
Robert I. Carr,et al.
TIME-COST TRADE-OFF AMONG RELATED ACTIVITIES
,
1989
.
[7]
D. R. Robinson.
A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
,
1975
.
[8]
Osama Moselhi,et al.
Schedule compression using the direct stiffness method
,
1993
.