Construction Time-Cost Trade-Off Analysis Using LP/IP Hybrid Method
Publication: Journal of Construction Engineering and Management
Volume 121, Issue 4
Abstract
Construction planners must select appropriate resources, including crew size, 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 techniques, the overall project cost can be reduced by using less expensive resources for noncritical activities without impacting the duration. Furthermore planners usually need to adjust the selection of resources in order to shorten or lengthen the project duration. Finding optimal decisions is difficult and time-consuming considering the numbers of permutations involved. For example, a critical-path-method network with only eight activities, each with two options, will have 256 (2 8 ) alternatives. Exhaustive enumeration is not economically feasible even with very fast computers. This paper presents a new algorithm using linear and integer programming to efficiently obtain optimal resource selections that optimize time and cost of a construction project.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Antill, J. M. (1982). Critical path methods in construction practical, 3rd Ed., John Wiley and Sons, New York, N.Y.
2.
Fondahl, J. W. (1961). “A non-computer approach to the critical path method for the construction industry.”Tech. Rep. No. 9, The Construction Inst., Dept. of Civ. Engrg., Stanford Univ., Stanford, Calif.
3.
Harris, R. B. (1978). Precedence and arrow networking techniques for construction . John Wiley and Sons, New York, N.Y.
4.
Kelly, J. E.(1961). “Critical path planning and scheduling: mathematical basis.”Oper. Res., 9(3), 296–320.
5.
Meyer, W. L., and Shaffer, L. R. (1963). “Extensions of the critical path method through the application of integer programming.”Civ. Engrg. Constr. Res. Series No. 2, University of Illinois, Urbana-Champaign, Ill.
6.
Moselhi, O.(1993). “Schedule compression using the direct stiffness method.”Can. J. Civ. Engrg., 20(1), 65–72.
7.
Patterson, J. H., and Huber, D.(1974). “A horizon-varying, zero-one approach to project scheduling.”Mgmt. Sci., 20(6), 990–998.
8.
Prager, W.(1963). “A structural sethod of computing project cost polygons.”Mgmt. Sci., 9(3), 394–404.
9.
Reda, R. M., and Carr, R. I.(1989). “Time-cost trade-off among related activities.”J. Constr. Engrg. and Mgmt., ASCE, 115(3), 475–486.
10.
Robinson, D. R.(1975). “A dynamic programming solution to cost-time trade-off for CPM.”Mgmt. Sci., 22(2), 158–166.
11.
Siemens, N. (1971). “A simple CPM time-cost tradeoff algorithm.”Mgmt. Sci., 17(6). B-354–363.
Information & Authors
Information
Published In
Copyright
Copyright © 1995 American Society of Civil Engineers.
History
Published online: Dec 1, 1995
Published in print: Dec 1995
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.