Progress payments in project scheduling problems

European Journal of Operational Research

Volumn 148, Issue 3, 2003, Pages 604-620

  Vanhoucke, Mario ^a,b   Demeulemeester, Erik ^c   Herroelen, Willy ^c  

^a VLERICK BUSINESS SCHOOL   (Belgium)

^b GHENT UNIVERSITY   (Belgium)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Branch and bound; Net present value; Progress payments; Project scheduling

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; SCHEDULING; TREES (MATHEMATICS);

CASH FLOWS;

OPERATIONS RESEARCH;

EID: 0037411872     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00452-6     Document Type: Article

References (45)

1. Baroum, S.M., 1992. An exact solution procedure for maximizing the net present value of resource-constrained projects. Unpublished Ph.D. Dissertation, Indiana University.
2. Baroum S.M., Patterson J.H. The development of cash flow weight procedures for maximizing the net present value of a project. Journal of Operations Management. 14:1996;209-227.
3. Baroum S.M., Patterson J.H. An exact solution procedure for maximizing the net present value of cash flows in a network. Weglarz J. Handbook on Recent Advances in Project Scheduling. 1999;107-134 Kluwer Academic Publishers, Dordrecht. (Chapter 5).
4. Dayanand, N., Padman, R., 1993a. The payment scheduling problem in project networks, Working Paper 9331. The Heinz School, CMU, Pittsburgh, PA 15213.
5. Dayanand, N., Padman, R., 1993b. Payments in projects: A constractor's model, Working Paper 9371. The Heinz School, CMU, Pittsburgh, PA 15213.
6. Dayanand N., Padman R. On modeling payments in project networks. Journal of the Operational Research Society. 48:1997;906-918.
7. Doersch R.H., Patterson J.H. Scheduling a project to maximize its present value: A zero-one programming approach. Management Science. 23:1977;882-889.
8. Elmaghraby S.E., Herroelen W. The scheduling of activities to maximize the net present value of projects. European Journal of Operational Research. 49:1990;35-49.
9. Erenguç S.S., Ahn T., Conway D.G. The resource constrained project scheduling problem with multiple crashable modes: An exact solution method. Naval Research Logistics. 48:2001;107-127.
10. Etgar R., Shtub A., LeBlanc L.J. Scheduling projects to maximize net present value - the case of time-dependent, contingent cash flows. European Journal of Operational Research. 96:1996;90-96.
11. Etgar R., Shtub A. Scheduling project activities to maximize the net present value - the case of linear time dependent, contingent cash flows. International Journal of Production Research. 37:1999;329-339.
12. Falk J.E., Soland R.M. An algorithm for separable nonconvex programming problems. Management Science. 15:1969;550-569.
13. Grinold R.C. The payment scheduling problem. Naval Research Logistics Quarterly. 19:1972;123-136.
14. Herroelen W., 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:1993;274-277.
15. Herroelen W., Demeulemeester E., De Reyck B. A classification scheme for project scheduling problems. Weglarz J. Handbook on Recent Advances in Project Scheduling. 1999;1-26 Kluwer Academic Publishers, Dordrecht. (Chapter 1).
16. Horst R. Deterministic methods in constrained global optimisation: Some recent advances and new fields of application. Naval Research Logistics. 37:1990;433-471.
17. Icmeli O., Erengüç S.S. A tabu search procedure for resource-constrained project scheduling with discounted cash flows. Computers and Operations Research. 21:1994;841-853.
18. Icmeli O., Erengüç S.S. A branch-and-bound procedure for the resource-constrained project scheduling problem with discounted cash flows. Management Science. 42:1996;1395-1408.
19. Kazaz B., Sepil C.B. Project scheduling with discounted cash flows and progress payments. Journal of the Operational Research Society. 47:1996;1262-1272.
20. Mastor A.A. An experimental and comparative evaluation of production line balancing techniques. Management Science. 16:1970;728-746.
21. Özdamar, L., Ulusoy, G., Bayyigit, M., 1994. A heuristic treatment of tardiness and net present value criteria in resource-constrained project scheduling, Working Paper. Department of Industrial Engineering, Marmara University.
22. Padman R., Smith-Daniels D.E., Smith-Daniels V.L. Heuristic scheduling of resource-constrained projects with cash flows. Naval Research Logistics. 44:1997;365-381.
23. 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:1993;295-311.
24. Patterson J.H., Slowinski R., Talbot F.B., Weglarz J. An algorithm for a general class of precedence and resource constrained scheduling problems, Part I. Slowinski R., Weglarz J. Advances in Project Scheduling. 1989;3-28 Elsevier Science Publishers, Amsterdam. (Chapter 1).
25. 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:1990;68-79.
26. Pinder J.P., Marucheck A.S. Using discounted cash flow heuristics to improve project net present value. Journal of Operations Management. 14:1996;229-240.
27. Russell A.H. Cash flows in networks. Management Science. 16:1970;357-373.
28. Russell R.A. A comparison of heuristics for scheduling projects with cash flows and resource restrictions. Management Science. 32:1986;291-300.
29. Schwindt, C., 1995. A new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags, WIOR-Report-449. Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe.
30. Sepil C., Ortaç N. Performance of the heuristic procedures for constrained projects with progress payments. Journal of the Operational Research Society. 48:1997;1123-1130.
31. Shtub A., Etgar R. A branch-and-bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows. International Journal of Production Research. 35:1997;3367-3378.
32. Smith-Daniels D.E., Aquilano N.J. Using a late-start resource-constrained project schedule to improve project net present value. Decision Sciences. 18:1987;617-630.
33. 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:1987;33-45.
34. Smith-Daniels D.E., Padman R., Smith-Daniels V.L. Heuristic scheduling of capital constrained projects. Journal of Operations Management. 14:1996;241-254.
35. Soland R.M. Optimal facility location with concave costs. Operations Research. 22:1974;373-382.
36. 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:1995;89-98.
37. Vanhoucke, M., 2001. Exact algorithms for various types of project scheduling problems - Nonregular objectives and time/cost trade-offs. Unpublished Ph.D. Dissertation, Katholieke Universiteit Leuven.
38. Vanhoucke M., Demeulemeester E., Herroelen W. An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research. 102:2000;179-196.
39. Vanhoucke, M., Demeulemeester, E., Herroelen, W., 2000b. Maximizing the net present value of a project with progress payments, Research Report 0028. Department of Applied Economics, Katholieke Universiteit Leuven.
40. Vanhoucke M., Demeulemeester E., Herroelen W. On maximizing the net present value of a project under renewable resource constraints. Management Science. 47:2001;1113-1121.
41. Vanhoucke M., Demeulemeester E., Herroelen W. Scheduling projects with linearly time-dependent cash flows to maximize the net present value. International Journal of Production Research. 39:2001;3159-3181.
42. 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:1992;188-198.
43. 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:1995;327-339.
44. Zhu, D., Padman, R., 1996. A tabu search approach for scheduling resource-constrained projects with cash flows, Working Paper 96-30. Carnegie-Mellon University.
45. Zhu D., Padman R. Connectionist approaches for solver selection in constrained project scheduling. Annals of Operations Research. 72:1997;265-298.