TY - JOUR
T1 - The LP/IP hybrid method for construction time-cost trade-off analysis
AU - Burns, Scott A.
AU - Liu, Liang
AU - Feng, Chung Wei
N1 - Funding Information:
This material is baseodnwrskopu otpedrbtyeh National Science Foundation under Grant No. DDM± 8491507.
PY - 1996/5
Y1 - 1996/5
N2 - 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 selections efficiently that optimize time/cost of a construction project.
AB - 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 selections efficiently that optimize time/cost of a construction project.
UR - http://www.scopus.com/inward/record.url?scp=4544318435&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=4544318435&partnerID=8YFLogxK
U2 - 10.1080/014461996373511
DO - 10.1080/014461996373511
M3 - Article
AN - SCOPUS:4544318435
SN - 0144-6193
VL - 14
SP - 265
EP - 276
JO - Construction Management and Economics
JF - Construction Management and Economics
IS - 3
ER -