Models for Accurate Computation of Earliest and Latest Start Times and Optimal Compression in Project Networks
Publication: Journal of Construction Engineering and Management
Volume 133, Issue 8
Abstract
Operations research techniques, especially linear and integer programming, have been suggested for use in project management. Most frequently these techniques are applied to finding critical path(s) in project networks and for compressing activities for an early project completion. The simplest of these models are usually found in introductory operations research/management science textbooks and they often suffer from a common deficiency: when they employ earliest start times (ES) as variables in the model, ES of activities that are not on the critical path may be computed incorrectly. This may lead to inefficient resource reallocation and leveling. Furthermore, activities outside the critical path may be compressed unnecessarily, as will be demonstrated in this paper. We present a zero–one mixed integer programming model to correctly compute earliest and latest start times of all activities and determine the optimal compression schedule. Several extensions to the model are offered to provide different perspectives of the project and enable a project manager to answer “what if” type questions. A small example is used to demonstrate the effectiveness of the models.
Get full access to this article
View all available purchase options and get full access to this article.
References
Abbasi, G. Y., and Mukattash, A. M. (2001). “Crashing PERT networks using mathematical programming.” Int. J. Proj. Manage., 19, 181–188.
Anderson, D. R., Sweeney, D. J., and Williams, T. A. (2003). An introduction to management science, 10th Ed., Southwestern, Mason, Ohio.
Arsham, H. (1993). “Managing project activity-duration uncertainties.” Omega, 21(1), 111–122.
Babu, A. J. G., and Suresh, N. (1996). “Project management with time, cost, and quality considerations.” Eur. J. Oper. Res., 88, 320–327.
Crowston, W. (1970). “Decision CPM: Network reduction and solution.” Oper. Res. Q., 21, 435–452.
Crowston, W., and Thompson, G. L. (1967). “Decision CPM: A method for simultaneous planning, scheduling, and control of projects.” Oper. Res., 15, 407–426.
Deckro, R. F., and Hebert, J. E. (1990). “A multiple objective programming framework for trade-off in project scheduling.” Engineering Costs and Production Economics, 18, 255–264.
Gümüşoglu, S., and Tütek, H. (1998). “An analysis method in project management using primal-dual relationships.” Int. J. Proj. Manage., 16(5), 321–327.
Harvey, R. T., and Paterson, J. H. (1979). “An implicit enumeration algorithm for the time-cost trade-off problem in project network analysis.” Foundations of Control Engineering, 4, 107–117.
Hillier, F. S., and Lieberman, G. J. (2001). Introduction to operations research, 7th Ed., McGraw-Hill, New York.
Lawrence, J. A., Jr., and Pasternack, B. A. (2002). Applied management science: Modeling, spreadsheet analysis, and communication for decision making, 2nd Ed., Wiley, New York.
Liu, L., Burns, S. A., 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, R. L. (1965). “Extending CPM for multiform project time-cost curves.” J. Constr. Div., 91, 45–65.
Moussourakis, J., and Haksever, C. (2004). “Flexible model for time/cost trade-off problem.” J. Constr. Eng. Manage., 130(3), 307–314.
Perera, S. (1980). “Linear programming solution to network compression.” J. Constr. Div., 106(3), 315–326.
Shogan, A. W. (1988). Management science, Prentice-Hall, Upper Saddle River, N.J.
Information & Authors
Information
Published In
Copyright
© 2007 ASCE.
History
Received: Dec 12, 2005
Accepted: Feb 22, 2007
Published online: Aug 1, 2007
Published in print: Aug 2007
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.