Skip to main content
SpringerLink
Log in

An Exact Solution Procedure for Maximizing the Net Present Value of Cash Flows in a Network

  • Chapter
Project Scheduling

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 14))

Abstract

Projects, as a method of organizing large endeavors, have been a part of the human experience for thousands of years. Ancient civilizations utilized the project approach to control grand undertakings. Most of humanity’s historic landmarks have been associated with projects, from Noah’s Ark and the Tower of Babel to the conquests of Alexander the Great and the Viking’s daring raids [Fangel (1988); Vila (1990)].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Baroum, Sami M. 1992. An Exact Solution Procedure For Maximizing The Net Present Value of Resource Constrained Projects. Unpublished PhD dissertation, Indiana University, Bloomington, Indiana.

    Google Scholar 

  • —, and J. H. Patterson. 1996. The Development of Cash Flow Weight Procedures for Maximizing the Net Present Value of a Project. Journal of Operations Management, 14;3, 209–228.

    Article  Google Scholar 

  • Bey, R.B., Doersch, R.H. and Patterson, J.H. 1981. The Net Present Value Criterion: Its Impact on Project Scheduling. Project Management Quarterly, 12;2, 35–45.

    Google Scholar 

  • Demeulemeester, E. and Herroelen, W. 1992. A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem.Management Science, 38;12, 1803–1818.

    Article  Google Scholar 

  • —,and.—. 1997. New Benchmark Results for the Resource-Constrained Project Scheduling Problem. Management Science, 43;11, 1485–1492.

    Article  Google Scholar 

  • —,and.—, Simpson, W.P., Baroum, S., Patterson, J.H. and Yang, K.K. 1994. Comments on a Paper by Christofedes et al. for Solving the Multiple-Resource Constrained, Single Project Scheduling Problem. European Journal of Operational Research, 76, 218–228.

    Article  Google Scholar 

  • Doersch, R.H. and Patterson, J.H. 1977. Scheduling a Project to Maximize its Present Value: A Zero-One Programming Approach. Management Science, 23;8, 882–889.

    Article  Google Scholar 

  • Elmaghraby, S.E. and Herroelen, W.S. 1990. The Scheduling of Activities to Maximize the Net Present Value of Projects. European Journal of Operational Research, 49, 35–49.

    Article  Google Scholar 

  • Erenguc, S.S., Sepil, C. and Tufekci, S. An Algorithm for a Project Scheduling Problem Using Discounted Cash Flows. Working paper, College of Business Administration, University of Florida.

    Google Scholar 

  • Fangel, M. 1988. The Viking Approach to Project Management. International Journal of Project Management, 6;2, 102–105.

    Article  Google Scholar 

  • French, S. 1982. Sequencing and Scheduling: An Introduction to the Mathematics of Job Shop. John Wiley & Sons, New York.

    Google Scholar 

  • Grinold, R.C. 1972. The Payment Scheduling Problem. Naval Research Logistics Quarterly, 19;1, 123–136.

    Article  Google Scholar 

  • Helgeson, W. B. and D. P. Birnie. 1961. Assembly Line Balancing Using Ranked Positional Weight Technique. Journal of Industrial Engineering, 12, 161–172.

    Google Scholar 

  • Herroelen, W. S. and E. Gallens. 1993. 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.

    Article  Google Scholar 

  • —, Willy S., Patrick Van Dommelen, and Erik L. Demeulemeester. 1997. Project Network Models with Discounted Cash Flows: A Guided Tour Through Recent Developments. European Journal of Operational Research, 100, 97–121.

    Article  Google Scholar 

  • Icmeli, Oya and S. Selcuk Erenguc. 1996. A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows. Management Science, 42;10, 1395–1408.

    Article  Google Scholar 

  • Johnson, R.V. 1988. Efficient Modular Implementation of Branch-and-Bound Algorithms. Decision Sciences, 19, 17–38.

    Article  Google Scholar 

  • Johnson, T.J.R. 1967. An Algorithm for the Resource-Constrained Project Scheduling Problem. Unpublished Ph.D. Thesis, School of Management, MIT.

    Google Scholar 

  • Padman, R., Smith-Daniels, D.E. and Smith-Daniels, V.L. 1990. Heuristic Scheduling of Resource-Constrained Projects with Cash Flows: An Optimization Based Approach. Working Paper, College of Business, Arizona State University.

    Google Scholar 

  • Patterson, J.H. 1984. A Comparison of Exact Approaches for solving the Multiple-Constrained Resource, Project Scheduling Problem. Management Science, 30; 7, 854–867.

    Article  Google Scholar 

  • —, Slowinski, R., Talbot, F.B, and Weglarz, J. 1989. An Algorithm for a General Class of Precedence and Resource Constrained Scheduling Problem. Studies in Production and Engineering Economics, (Advances in Project Scheduling), Slowinski, R. and Weglarz, J. (eds.), Elsevier, Amsterdam, The Netherlands, 9, 3–28.

    Google Scholar 

  • —, Talbot, F.B., Slowinski, R., and Weglarz, J. 1990. 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.

    Article  Google Scholar 

  • Russell, A. H. 1970. Cash Flows in Networks. Management Science, 16;5, 357–373.

    Article  Google Scholar 

  • Russell, R.A. 1986. A comparison of Heuristics for Scheduling Projects with Cash Flows and Resource Restrictions. Management Science, 32;10, 1291–1300.

    Article  Google Scholar 

  • Smith-Daniels, D.E. 1986. Summary Measures for Predicting the Net Present Value of a Project. Working Paper, College of St. Thomas, St. Paul, Minnesota.

    Google Scholar 

  • — and Aquilano, N.J. 1987. Using a Late-Start Resource-Constrained Project Schedule to Improve Project Net Present Value. Decision Sciences, 18, 617–630.

    Article  Google Scholar 

  • — and Smith-Daniels, V.L. 1987. Maximizing the Net Present Value of a Project Subject to Materials and Capital Constraints. Journal of Operations Management, 7;1, 33–45.

    Article  Google Scholar 

  • Stinson, J.P. 1976. A Branch and Bound Algorithm for a General Class of Multiple Resource-Constrained Scheduling Problems. Unpublished Ph.D. dissertation, University of North Carolina, Chapel Hill, North Carolina.

    Google Scholar 

  • —, Davis, E.W. and Khumawala, B.M. 1978. Multiple Resource-Constrained Scheduling Using Branch and Bound. AIIE Transactions, 10;3, 252–259.

    Article  Google Scholar 

  • Talbot, F. B. and Patterson, J.H. 1978. An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems. Management Science, 24; 11, 1163–1174.

    Article  Google Scholar 

  • Vila, J.M. 1990. Reflections on a Complex Project. Datamation, 36, 101–103.

    Google Scholar 

  • Weeks, J. 1971. The Pyramids. Cambridge University Press, Great Britain.

    Google Scholar 

  • Yang, K.K., Talbot, F.B., and J.H. Patterson. 1992. Scheduling a Project to Maximize its Net Present Value: An Integer Programming Approach. European Journal of Operational Research, 64;2, 188–198.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indiana University, USA

    Sami M. Baroum & James H. Patterson

Authors
  1. Sami M. Baroum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James H. Patterson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Poznan University of Technology, USA

    Jan Węglarz

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Baroum, S.M., Patterson, J.H. (1999). An Exact Solution Procedure for Maximizing the Net Present Value of Cash Flows in a Network. In: Węglarz, J. (eds) Project Scheduling. International Series in Operations Research & Management Science, vol 14. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5533-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5533-9_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7529-6

  • Online ISBN: 978-1-4615-5533-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation