Chance-Constrained Time–Cost Tradeoff Analysis Considering Funding Variability
Publication: Journal of Construction Engineering and Management
Volume 131, Issue 9
Abstract
This paper proposes a chance-constrained programming model to incorporate the variability of funding, which is quantified by the coefficient of variation. The proposed model formulates financial feasibility as a stochastic constraint, transforms it into a deterministic equivalent at a prespecified confidence level, and solves the system by means of classical optimization techniques. The time–cost curve generated by the proposed model serves as a foundation for optimizing total project cost. To demonstrate the uniqueness of the proposed model, it is compared to previous approaches through a small building example.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
The writer wishes to thank the anonymous reviewers for their constructive suggestions. The present research is financially supported by National Science Council, Taiwan under Grant No. NSCTNSC-93-2211-E-032-019.
References
Benjamin, J. R., and Cornell, C. A. (1970). Probability, statistics, and decision for civil engineers, McGraw–Hill, New York.
Butcher, W. S. (1967). “Dynamic programming for project cost-time curve.” J. Constr. Div., Am. Soc. Civ. Eng., 93(1), 59–73.
Charnes, A., and Cooper, W. W. (1959). “Chance-constrained programming.” Manage. Sci., 6, 73–79.
Coskunoglu, O. (1984). “Optimal probabilistic compression of PERT networks.” J. Constr. Eng. Manage., 110(4), 437–446.
Dantzig, G. (1955). “Linear programming under uncertainty.” Manage. Sci., 1, 197–206.
Demeulemeester, E. L., Herroelen, W. S., and Elmaghraby, S. E. (1996). “Optimal procedures for the discrete time/cost tradeoff problem in project networks.” Eur. J. Oper. Res., 88, 50–68.
Ellis, J. H., Corotis, R. B., and Zimmerman, J. J. (1991). “Stochastic programs for identifying critical structural collapse mechanisms.” Appl. Math. Model., 15, 367–373.
Falk, J., and Horowitz, J. L. (1972). “Critical path problems with concave cost-time curves.” Manage. Sci., 19, 446–455.
Feng, C. W., Liu, L., and Burns, S. A. (1997). “Using genetic algorithms to solve construction time-cost trade-off problems.” J. Comput. Civ. Eng., 11(3), 184–189.
Feng, C. W., Liu, L., and Burns, S. A. (2000). “Stochastic construction time-cost trade-off analysis.” J. Comput. Civ. Eng., 14(2), 117–126.
Foldes, S., and Sourmis, F. (1993). “PERT and crashing revisited: Mathematical generalizations.” Eur. J. Oper. Res., 64, 286–294.
Fondahl, J. W. (1961). “A non-computer approach to the critical path method for the construction industry.” Technical Rep. No. 9, Dept. of Civil Engineering, The Construction Institute, Stanford Univ., Stanford, Calif.
Fuessle, R. W., Brill, E. D., and Liebman, J. C. (1987). “Air quality planning: A general chance-constraint model.” J. Environ. Eng., 113(1), 106–123.
Fulkerson, D. R. (1961). “A network flow computation for project cost curves.” Manage. Sci., 7, 127–178.
Harris, R. B. (1978). Precedence and arrow networking techniques for construction, Wiley, New York.
Hegazy, T. (1999). “Optimization of construction time-cost tradeoff analysis using genetic algorithms.” Can. J. Civ. Eng., 26(6), 685–697.
Hillier, F. S., and Lieberman, G. J. (1991). Introduction to mathematical programming, McGraw–Hill, New York.
Iwamura, K. (2001). “An algorithmic study on basic planning problems in operations research.” PhD thesis, Josai Univ., Sakado, Saitama, Japan.
Kelly, J. E. (1961). “Critical path planning and scheduling: Mathematical basis.” Oper. Res., 9, 296–320.
Kendrick, T. (2003). Identifying and managing project risk, American Management Association, New York, 108–109.
Lapin, L. L. (1996). Modern engineering statistics, Duxbury Press, Belmont, Calif.
Leu, S. S., Chen, A. T., and Yang, C. H. (2001). “A GA-based fuzzy optimal model for construction time-cost tradeoff.” Int. J. Proj. Manage., 19(1), 47–58.
Leu, S. S., and Yang, C. H. (1999). “GA-based multicriteria optimal model for construction scheduling.” J. Constr. Eng. Manage., 125(6), 420–427.
Li, H., Cao, J. N., and Love, P. (1999). “Using machine learning and GA to solve time-cost trade-off problems.” J. Constr. Eng. Manage., 125(5), 347–353.
Li, H., and Love, P. (1997). “Using improved genetic algorithms to facilitate time-cost optimization.” J. Constr. Eng. Manage., 123(3), 233–237.
Liu, L., Burns, S. C., and Feng, C. W. (1995). “Construction time-cost trade-off analysis using LP/IP hybrid method.” J. Constr. Eng. Manage., 121(4), 446–454.
Meyer, W. L., and Shaffer, L. R. (1963). “Extensions of the critical path method through the application of integer programming.” Civil engineering construction research series No. 2, Univ. of Illinois, Urbana, Ill.
Moder, J. J., and Phillips, C. R. (1970). Project management with CPM and PERT, 2nd Ed., Van Nostrand Reinhold, New York.
Moselhi, O. (1993). “Schedule compression using the direct stiffness method.” Can. J. Civ. Eng., 20, 65–72.
Murty, K. G. (1992). Network programming, Prentice–Hall, Englewood Cliffs, 416–423.
Näslund, B. (1967). “Decision under risk.” Publication No. 8162, Economic Research Institute, Stockholm School of Economics, Stockholm, Sweden.
Ouarda, T. B. M. J., and Labadie, J. W. (2001). “Chance-constrained optimal control for multireservoir system optimization and risk analysis.” Stochastic environmental research and risk assessment, Springer, Heidelberg, Germany, Vol. 15, 185–204.
Prekopa, A. (1995). Stochastic programming, Kluwer Academic, New York.
Reda, R. M., and Carr, R. I. (1989). “Time-cost tradeoffs among related activities.” J. Constr. Eng. Manage., 115(3), 475–486.
Schrage, L. (1999). Optimization modeling with LINGO, Lindo Systems, Inc., Chicago, Ill.
Senouci, A. B., and Adeli, H. (2001). “Resource scheduling using neural dynamics model of Adeli and Park.” J. Constr. Eng. Manage., 127(1), 28–34.
Siemens, N. (1971). “A simple CPM time-cost tradeoff algorithm.” Manage. Sci., 17(6), 354–363.
Skutella, M. (1997). “Approximation algorithms for the discrete time-cost tradeoff problem.” Proc., 8th Annual ACM-SIAM Symp. on Discrete Algorithms, New Orleans Society of Industrial and Applied Mathematics, 501–508.
Watanabe, T., and Ellis, H. (1994). “A joint chance-constrained programming model with row dependence.” Eur. J. Oper. Res., 77, 325–343.
Information & Authors
Information
Published In
Copyright
© 2005 ASCE.
History
Received: Dec 23, 2003
Accepted: Apr 8, 2005
Published online: Sep 1, 2005
Published in print: Sep 2005
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.