×

Project network models with discounted cash flows a guided tour through recent developments. (English) Zbl 0947.90583

Summary: The vast majority of the project scheduling methodologies presented in the literature have been developed with the objective of minimizing the project duration subject to precedence and other constraints. In doing so, the financial aspects of project management are largely ignored. Recent efforts have taken into account discounted cash flows and have focused on the maximization of the net present value (npv) of the project as the more appropriate objective. In this paper we offer a guided tour through the important recent developments in the expanding field of research on deterministic and stochastic project network models with discounted cash flows. Subsequent to a close examination of the rationale behind the npv objective, we offer a taxonomy of the problems studied in the literature and critically review the major contributions. Proper attention is given to npv maximization models for the unconstrained scheduling problem with known cash flows, optimal and suboptimal scheduling procedures with various types of resource constraints, and the problem of determining both the timing and amount of payments.

MSC:

90B35 Deterministic scheduling theory in operations research
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Baroum, S. M., An Exact Solution Procedure for Maximizing the Net Present Value of Resource-Constrained Projects (1992), Indiana University, unpublished Ph.D. dissertation
[2] Baroum, S. M.; Patterson, J. H., A Comparative Evaluation of Cash Flow Weight Heuristics for Maximizing the Net Present Value of a Project (June 1993), King Abdul Aziz University, Working Paper
[3] Bey, R. P.; Doersch, R. H.; Patterson, J. H., The Present Value Criterion: Its Impact on Project Scheduling, Project Management Quarterly, 12, 35-45 (1981)
[4] Brealey, R. A.; Myers, S. C., Principles of Corporate Finance (1992), McGraw-Hill
[5] Bierman, H.; Smidt, S., The Capital Budgeting Decision (1988), McMillan
[6] Buss, A. H.; Rosenblatt, M. J., Activity Delay in Stochastic Project Networks (November 1993), Washington University, Working Paper
[7] Buss, A. H.; Rosenblatt, M. J., Resource Constrained Scheduling in Stochastic Project Networks, (Paper presented at the INFORMS International Singapore Meeting (1995))
[8] Christenson, C., Construction of Present Value Tables for Use in Evaluation of Capital Investment Opportunities, The Accounting Review, 666-673 (1955), Oct.
[9] Christofides, N.; Alvarez-Valdes, R.; Tamarit, J. M., Project Scheduling with Resource Constraints: A Branch-and-Bound Approach, European Journal of Operational Research, 29, 262-273 (1987) · Zbl 0614.90056
[10] Dayanand, N.; Padman, R., Payments in Projects: A Contractor’s Model, (Working Paper 93-71 (December 1993), Carnegie Mellon University) · Zbl 0892.90099
[11] Dayamand, N.; Padman, R., On Modeling Progress Payments in Projects (December 1995), Carnegie Mellon University, Working Paper
[12] Dean, J., Measuring the Productivity of Capital, Harvard Business Review, 120-130 (1954), Jan.-Febr.
[13] Demeulemeester, E.; Herroelen, W., A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem, Management Science, 38, 1803-1818 (1992) · Zbl 0761.90059
[14] Demeulemeester, E. L.; Herroelen, W. S., New Benchmark Results for the Resource-Constrained Project Scheduling Problem, (Research Report 9521 (1995), Department of Applied Economics: Department of Applied Economics K.U. Leuven), to appear in Management Science · Zbl 0914.90160
[15] Demeulemeester, E.; Herroelen, W.; Van Dommelen, P., An Optimal Recursive Search Procedure for the Deterministic Unconstrained Max-npv Project Scheduling Problem, (Research Report 9603 (1996), Department of Applied Economics: Department of Applied Economics K.U. Leuven)
[16] De Reyck, B.; Herroelen, W., Assembly Line Balancing by Resource constrained Project Scheduling Techniques — A Critical Appraisal, (Research Report 9505 (1995), Department of Applied Economics: Department of Applied Economics K.U. Leuven) · Zbl 0899.68007
[17] De Wit, J.; Herroelen, W., An Evaluation of Micro-computer Based Software Packages for Project Management, European Journal of Operational Research, 49, 102-139 (1990) · Zbl 06908678
[18] Dixit, A. K.; Pindyck, R. S., Investment under Uncertainty (1994), Princeton University Press: Princeton University Press Princeton, New Jersey
[19] Doersch, R. H.; Patterson, J. H., Scheduling a Project to Maximize its Present Value: A Zero-One Programming Approach, Management Science, 23, 882-889 (1977) · Zbl 0354.90043
[20] Elmaghraby, S. E., Activity Nets: A Guided Tour through Some Recent Developments, European Journal of Operational Research, 82, 383-408 (1995) · Zbl 0910.90175
[21] Elmaghraby, S. E.; Herroelen, W. S., The Scheduling of Activities to Maximize the Net Present Value of Projects, European Journal of Operational Research, 49, 35-49 (1990) · Zbl 1403.90670
[22] Erengüç, S. S.; Tufekci, S.; Zappe, C. J., The Solution of the Time/Cost Trade-Off Problem with Discounted Cash Flows Using Generalized Benders Decomposition, (Research Report (1991), University of Florida) · Zbl 0766.90055
[23] Gilbreath, R. D., Managing Construction Contracts-Operational Controls for Commercial Risks (1992), John Wiley and Sons, Inc: John Wiley and Sons, Inc New York
[24] Gilliard, R., Coût de Travaux de Genie Civil (1971), Dunod: Dunod Paris
[25] Grinold, R. C., The Payment Scheduling Problem, Naval Research Logistics Quarterly, 19, 123-136 (1972) · Zbl 0252.90034
[26] Hartmann, S.; Sprecher, A., A Note on “Hierarchical Models for Multi-Project Planning and Scheduling”, (Research Report N° 338 (1993), Christian-Albrechts-Universität zu Kiel: Christian-Albrechts-Universität zu Kiel Germany) · Zbl 0953.90518
[27] Helgeson, W. B.; Birnie, D. P., Assembly Line Balancing Using Ranked Positional Weight Technique, Journal of Industrial Engineering, 12, 161-172 (1961), 1961
[28] Herroelen, W. S.; Gallens, E., Computational Experience with an Optimal Procedure for the Scheduling of Activities to Maximize the Net Present Value of Projects, European Journal of Operational Research, 65, 274-277 (1993) · Zbl 0775.90232
[29] Icmeli, O.; Erengüç, S. S., A Tabu Search Procedure for Resource Constrained Project Schedule to Improve Project Scheduling Problems with Discounted Cash Flows, Computers and Operations Research, 21, 841-853 (1994) · Zbl 0812.90065
[30] Icmeli, O.; Erengüç, S. S., A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows, (Working paper (July 1995), Cleveland State University) · Zbl 0880.90074
[31] Icmeli, O.; Erengüç, S. S.; Zappe, C. J., Project Scheduling Problems: A Survey, International Journal of Operations and Production Management, 13, 80-91 (1993)
[32] Jolayemi, J. K.; Oluleye, A. E., Scheduling of Projects Under the Condition of Inflation, OMEGA Int. J. of Mgmt. Sci., 21, 481-487 (1993)
[33] Kolisch, R.; Sprecher, A.; Drexl, A., Characterization and Generation of a General Class of Resource Constrained Project Scheduling Problems, Management Science, 41, 1693-1703 (1995) · Zbl 0870.90070
[34] Marsh, P. D., Contracts and Payment Structures, (Lock, D., Project Management Handbook (1987)), 93-118, Chapter 5
[35] Morton, T. E.; Kekre, S.; Lawrence, S.; Rajagopalan, S., SCHED-STAR: A Price Based Shop Scheduling Module, Journal of Manufacturing and Operations Management, 1, 131-181 (1988)
[36] Morton, T. E.; Pentico, D. W., Heuristic Scheduling Systems—With Applications to Production Systems and project Management (1993), John Wiley and Sons
[37] Neo, R. B., International Construction Contracting (1976), Gower
[38] Özdamar, L.; Ulusoy, G., A Survey on the Resource-Constrained Project Scheduling Problem, IIE Transactions, 27, 574-586 (1995)
[39] Özdamar, L.; Ulusoy, G.; Bayyigit, M., A Heuristic Treatment of Tardiness and Net Present Value Criteria in Resource Constrained Project Scheduling, (Working Paper (October 1994), Department of Industrial Engineering, Marmara University)
[40] Padman, R.; Smith-Daniels, D. E.; Smith-Daniels, V. L., Heuristic Scheduling of Resource-Constrained Projects with Cash Flows: An Optimization Based Approach, (Working paper 90-6 (January 1990), Carnegie-Mellon University) · Zbl 0890.90108
[41] Padman, R.; Smith-Daniels, D. E., Maximizing the Net Present Value of Capital Constrained Projects: An Optimization-Guided Approach, (Working Paper 93-56 (September 1993), Carnegie Mellon University)
[42] Padman, R.; Smith-Daniels, D. E., Early Tardy Cost Trade Offs in Resource Constrained Projects with Cash Flows: An Optimization-Guided Heuristic Approach, European Journal of Operational Research, 64, 295-311 (1993) · Zbl 0769.90051
[43] Padman, R.; Zhu, D., On Integrating Knowledge Sources Using Problem Spaces: An Application in Project Scheduling, (Working Paper 94-02 (January 1994), Carnegie Mellon University)
[44] Patterson, J. H., A Comparison of Exact Procedures for Solving the Multiple-Constrained Resource Project Scheduling Problem, Management Science, 20, 767-784 (1984)
[45] Patterson, J. H.; Slowinski, R.; Talbot, F. B.; Weglarz, J., An Algorithm for a General Class of Precedence and Resource-Constrained Scheduling Problems, (Slowinski, R.; Weglarz, J., Advances in Project Scheduling (1989), Elsevier Science Publishers: Elsevier Science Publishers Amsterdam), 3-28, Part I, Chapter 1
[46] Patterson, J. H.; Talbot, F. B.; Slowinski, R.; Weglarz, J., Computational Experience with a Backtracking Algorithm for Solving a General Class of Precedence and Resource-Constrained Scheduling Problems, European Journal of Operational Research, 49, 68-79 (1990) · Zbl 1403.90678
[47] Pinder, J. P., A Hierarchical Project Management Model, ((1988), The University of North-Carolina at Chapell Hill), unpublished Ph.D. dissertation
[48] Russell, A. H., Cash Flows in Networks, Management Science, 16, 357-373 (1970) · Zbl 0187.18201
[49] Russell, R. A., A Comparison of heuristics for Scheduling Projects with Cash Flows and Resource Restrictions, Management Science, 32, 291-300 (1986)
[50] Scudder, G. D.; Smith-Daniels, D. E., Application of the Net Present Value Criterion in Random and Flow Shop Scheduling, Decision Sciences, 20, 602-622 (1989)
[51] Sepil, C., Comment on Elmaghraby’s and Herroelen’s The Scheduling of Activities to Maximize the Net Present Value of Projects, European Journal of Operational Research, 73, 185-187 (1994) · Zbl 0808.90083
[52] Sepil, C.; Kazaz, B., Project Scheduling with Discounted Cash Flows and Progress Payments, (Working Paper 94-7 (1994), Middle East Technical University: Middle East Technical University Ankara) · Zbl 0863.90088
[53] Sepil, C.; Ortaç, N., Performance of the heuristic Procedures for Constrained Projects with Progress Payments, (Working Paper (1995), Middle East Technical University) · Zbl 0894.90082
[54] Slowinski, R., Multiobjective Network Scheduling with Efficient Use of Renewable and Nonrenewable Resources, European Journal of Operational Research, 7, 265-273 (1981) · Zbl 0455.90049
[55] Slowinski, R., Multiobjective Project Scheduling Under Multiple Category Resource Constraints, (Slowinski, R.; Weglarz, J., Advances In Project Scheduling (1989), Elsevier: Elsevier Amsterdam), 151-167
[56] Smith-Daniels, D. E., Summary Measures for Predicting the Net Present Value of a Project, (Working Paper (1986), College of St. Thomas: College of St. Thomas St. Paul, Minnesota)
[57] Smith-Daniels, D. E.; Aquilano, N. J., Using a Late-Start Resource-Constrained Project Schedule to Improve Project Net Present Value, Decision Sciences, 18, 617-630 (1987)
[58] Smith-Daniels, D. E.; Smith-Daniels, V. L., Maximizing the Net Present Value of a Project Subject to Materials and Capital Constraints, Journal of Operations Management, 7, 33-45 (1987)
[59] Speranza, M. G.; Vercellis, C., Hierarchical Models for Multi-Project Planning and Scheduling, European Journal of Operational Research, 64, 312-325 (1993) · Zbl 0779.90046
[60] Talbot, F. B.; Patterson, J. H., An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Project Scheduling Problems, Management Science, 24, 1163-1164 (1978) · Zbl 0395.90036
[61] Twort, A. C., Civil Engineering: Supervision and Management (1986), Federal Publications Kowloon
[62] Ulusoy, G.; Özdamar, L., A Framework for an Interactive Project Scheduling System under Limited Resources, (Paper presented at the Fourth International Workshop on Project Management and Scheduling. Paper presented at the Fourth International Workshop on Project Management and Scheduling, Leuven (1994)) · Zbl 0916.90157
[63] Ulusoy, G.; Özdamar, L., A Heuristic Scheduling Algorithm for Improving the Duration and Net Present Value of a Project, International Journal of Operations and Production Management, 15, 89-98 (1995)
[64] van Hee, K. M.; Lenstra, J. K., Editorial: A Comparative Study in DSS Development, European Journal of Operational Research, 79, 153-157 (1994)
[65] Westney, R. E., Managing the Engineering and Construction of Small Projects — Practical Techniques for Planning, Estimating, Project Control, and Computer Applications (1985), Marcel Dekker, Inc
[66] Westney, R. E., Computerized Management of Multiple Small Projects (1992), Marcel Dekker, Inc
[67] Yang, K. K.; Talbot, F. B.; Patterson, J. H., Scheduling a Project to Maximize Its Net Present Value: An Integer Programming Approach, European Journal of Operational Research, 64, 188-198 (1992) · Zbl 0769.90053
[68] Yang, K. K.; Tay, L. C.; Sum, C. C., A Comparison of Stochastic Scheduling Rules for Maximizing Project Net Present Value, European Journal of Operational Research, 85, 327-339 (1995) · Zbl 0912.90184
[69] Zhu, D.; Padman, R., Heuristic Selection in Resource-Constrained Project Scheduling: Experiments with Neural Networks, (Working Paper 93-43 (July 1993), Carnegie Mellon University) · Zbl 0825.68243
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.