Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows

Annals of Operations Research

Volumn 102, Issue 1-4, 2001, Pages 237-261

  Ulusoy, Gündüz ^a   Sivrikaya Şerifoǧlu, Funda ^b   Şahin, Şule ^c  

^a SABANCI UNIVERSITY   (Turkey)

^b ABANT IZZET BAYSAL UNIVERSITY   (Turkey)

^c BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Discounted cash flow; Payment models; Project scheduling; Resource constraints

Indexed keywords

EID: 0042788727     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1010914417817     Document Type: Article

References (44)

1. S.M. Baroum and J.H. Patterson, An exact solution procedure for maximizing the net present value of a project, in: Handbook on Recent Advances in Project Scheduling, ed. J. Wȩglarz (Kluwer Academic, 1999).
2. R.B. Bey, R.H. Doersch and J.H. Patterson, The net present value criterion: its impact on project scheduling, Project Management Quarterly 12 (1981) 223-233.
3. J. Blazewicz, J.K. Lenstra and A.H.G. Rinnooy Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics 5 (1983) 11-24.
4. N. Dayanand and R. Padman, Payments in projects: A contractor's model, Working Paper 93-71, The Heinz School, Carnegie Mellon University, Pittsburgh, PA (1993).
5. N. Dayanand and R. Padman, A simulated annealing approach for scheduling payments in projects, Working Paper 94-40, The Heinz School, Carnegie Mellon University, Pittsburgh, PA (1994).
6. N. Dayanand and R. Padman, On modelling payments in projects, Journal of the Operational Research Society 48 (1997) 906-918.
7. N. Dayanand and R. Padman, Project contracts and payment schedules: The client's problem, Working Paper, The Heinz School, Carnegie Mellon University, Pittsburgh, PA (1998).
8. N. Dayanand and R. Padman, On payment schedules in contractor client negotiations in projects: An overview of the problem and research issues, in: Handbook on Recent Advances in Project Scheduling, ed. J. Wȩglarz (Kluwer Academic, 1999) pp. 477-508.
9. R.H. Doersch and J.H. Patterson, Scheduling a project to maximize its present value: A zero-one programming approach, Management Science 23 (1977) 882-889.
10. A. Drexl and J. Grünewald, Nonpreemptive multi-mode resource constrained project scheduling, IIE Transactions 25 (1993) 74-81.
11. S.E. Elmaghraby and W.S. Herroelen, The scheduling of activities to maximize the net present value of projects, European Journal of Operational Research 49 (1990) 35-40.
12. D.E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning (Addison-Wesley, 1989).
13. J.J. Grefenstette, Optimization of control parameters for genetic algorithms, IEEE Transactions on Systems, Man, and Cybernetics SMC-16 (1986) 122-128.
14. R.C. Grinold, The payment scheduling problem, Naval Research Logistics Quarterly 9 (1972) 123-136.
15. S. Hartmann, Project scheduling with multiple modes: A genetic algorithm, Technical Report 435, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universitaet Kiel, Kiel, Germany (1997).
16. S. Hartmann, A competitive genetic algorithm for resource-constrained project scheduling, Naval Research Logistics 45 (1998) 733-750.
17. W.S. Herroelen, B. De Reyck and E.L. Demeulemeester, Project network models with discounted cash flows: A guided tour through recent developments, European Journal of Operational Research 100 (1997) 97-121.
18. W.S. Herroelen, E.L. Demeulemeester and B. De Reyck, A classification scheme for project scheduling, in: Handbook on Recent Advances in Project Scheduling, ed. J. Wȩglarz (Kluwer Academic, 1999) pp. 1-26.
19. W.S. Herroelen, P. van Dommelen and E.L. Demeulemeester, Resource-constrained project scheduling: A survey of recent developments, Computers and Operations Research 25 (1998) 279-302.
20. J.H. Holland, Adaptation in Natural and Artificial Systems (The University of Michigan Press, Ann Arbor, 1975).
21. O. Icmeli and S.S. Erenguc, A branch-and-bound procedure for the resource-constrained project scheduling with discounted cash flows, Management Science 42 (1996) 1395-1408.
22. B. Kazaz and C. Sepil, Project scheduling with discounted cash flows and progress payments, Journal of the Operational Research Society 47 (1996) 1262-1272.
23. M. Khattab and F. Choobineh, A new approach for project scheduling with a limited resource, International Journal of Production Research 29 (1991) 185-198.
24. R. Kolisch, Project Scheduling under Resource Constraints (Physica-Verlag, Heidelberg, 1995).
25. R. Kolisch and R. Padman, An integrated survey of project scheduling, Technical Report 463, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, Kiel, Germany (1998).
26. J.-K. Lee and Y.-D. Kim, Search heuristics for resource constrained project scheduling, Journal of the Operational Research Society 47 (1996) 678-689.
27. K.Y. Li and R.J. Willis, An iterative scheduling technique for resource-constrained project scheduling, European Journal of Operational Research 56 (1992) 370-379.
28. M. Mori and C.C. Tseng, A genetic algorithm for multi-mode resource constrained project scheduling problem, European Journal of Operational Research 100 (1997) 134-141.
29. L. Özdamar, A genetic algorithm approach to a general category project scheduling problem, IEEE Trans. Systems, Man and Cybernetics, Part C: Applications and Reviews 29(1) (1999) 44-59.
30. L. Özdamar and G. Ulusoy, A survey on the resource-constrained project scheduling problem, IIE Transactions 27 (1995) 574-586.
31. R. Padman and D.E. Smith-Daniels, 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.
32. A.H. Russell, Cash flows in networks, Management Science 16 (1970) 357-373.
33. R.A. Russell, A comparison of heuristics for scheduling projects with cash flows and resource restrictions, Management Science 32 (1986) 291-300.
34. C. Sepil and N. Ortac, Performance of the heuristic procedures for constrained projects with progress payments, Journal of the Operational Research Society 48 (1997) 1123-1130.
35. F. Sivrikaya-Şerifoǧlu, A new uniform order-based crossover operator for genetic algorithm applications to multi-component combinatorial optimization problems, Unpublished Ph.D. Dissertation, Boǧaziçi University, Istanbul (1997).
36. F. Sivrikaya-Şerifoǧlu, A new uniform order-based crossover for concurrent consideration of sequencing and selection problems, Working Paper, Abant İzzet Baysal University, Bolu, Turkey (1998).
37. F. Sivrikaya-Şerifoǧlu and G. Ulusoy, Parallel machine scheduling with earliness and tardiness penalties, Computers and Operations Research 26 (1999) 773-787.
38. R. Slowinski, Two approaches to problems of resource allocation among project activities - a comparative study, Journal of the Operational Research Society 31 (1980) 711-723.
39. D.E. Smith-Daniels and N.J. Aquilano, Using a late start resource constrained project schedule to improve project net present value, Decision Sciences 18 (1987) 617-630.
40. G. Ulusoy and L. Özdamar, Heuristic performance and network/resource characteristics in resource-constrained project scheduling, Journal of Operational Research Society 40 (1989) 1145-1152.
41. G. Ulusoy and L. Özdamar, A constraint-based perspective in resource constrained project scheduling, International Journal of Production Research 32 (1994) 693-705.
42. G. Ulusoy and L. Özdamar, A heuristic scheduling algorithm for improving the duration and net present value of a project, International Journal of Operations & Production Management 15 (1995) 89-98.
43. G. Ulusoy and S. Cebelli, An equitable approach to the payment scheduling problem in project management, European Journal of Operational Research 127 (2000) 262-278.
44. G. Ulusoy, F. Sivrikaya-Şerifoǧlu and Ü. Bilge, A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles, Computers and Operations Research 24 (1997) 335-351.