Project Compression with Nonlinear Cost Functions
Publication: Journal of Construction Engineering and Management
Volume 136, Issue 2
Abstract
This paper presents three mixed-integer linear programming models to assist project managers in making decisions to compress project completion time under realistic activity time-cost relationship assumptions. The models assume nonlinear activity time-cost functions that are rational functions that can be convex or concave. A user of the models needs to estimate an activity time between normal and crash times where the rate of increase in the cost of performing an activity changes significantly. An efficient piecewise linearization method is presented through which nonlinear cost functions can be approximated in a mixed-integer linear programming model. Each of the models focuses on a different objective a project manager may pursue, such as minimizing project completion subject to a crash budget constraint, or minimizing total project cost, or minimizing total cost under late completion penalties or minimizing total cost with early completion bonuses of a project contract. The paper also uses a simple example which has activities that have all the different types of cost functions discussed in the paper to demonstrate how each model can be used for a project manager’s different objectives.
Get full access to this article
View all available purchase options and get full access to this article.
References
Berman, E. B. (1964). “Resource allocation in a PERT network under continuous activity time-cost functions.” Manage. Sci., 10(4), 734–745.
Deckro, R. F., Hebert, J. E., Verdini, W. A., Grimsrud, P. H., and Venkateshwar, S. (1995). “Nonlinear time/cost tradeoff models in project management.” Comput. Ind. Eng., 28(2), 219–229.
Elmaghraby, S. E., and Pulat, P. S. (1979). “Optimal project compression with due-dated events.” Naval Res. Logistics Quart., 26(2), 331–348.
Falk, J. S., and Horowitz, J. L. (1972). “Critical path problems with concave cost-time curves.” Manage. Sci., 19(4), 446–455.
Foldes, S., and Soumis, F. (1993). “PERT and crashing revisited: Mathematical generalizations.” Eur. J. Oper. Res., 64, 286–294.
Kuyumcu, A., and Garcia-Diaz, A. (1994). “A decomposition approach to project compression with concave activity cost functions.” IIE Trans., 26(6), 63–73.
Meyer, W. L., and Shaffer, R. L. (1965). “Extending CPM for multiform project time-cost curves.” Proc. Am. Soc. Civ. Eng., 91, 45–65.
Mitchell, G., and Klastorin, T. (2007). “An effective methodology for the stochastic project compression problem.” IIE Trans., 39(10), 957–969.
Moussourakis, J., and Haksever, C. (2007). “Models for accurate computation of earliest and latest start times and optimal crashing in project networks.” J. Constr. Eng. Manage., 133(8), 600–608.
Salem, A. D., and Elmaghraby, S. E. (1984). “Optimal linear approximation in project compression.” IIE Trans., 16(4), 339–347.
Vrat, P., and Kriengkrairut, C. (1986). “A goal programming model for project crashing with piecewise linear time-cost trade-off.” Eng. Costs Prod. Econ., 10, 161–172.
Wei, C. -C., and Wang, C. -M. F. (2003). “Efficient approaches of linearization in project compression.” Comput. Ind. Eng., 44, 695–706.
Yang, I. -T. (2007). “Performing complex project crashing analysis with aid of particle swarm optimization algorithm.” Int. J. Proj. Manage., 25, 637–646.
Information & Authors
Information
Published In
Copyright
© 2010 ASCE.
History
Received: Dec 2, 2008
Accepted: Jul 14, 2009
Published online: Jul 16, 2009
Published in print: Feb 2010
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.