Maksymalizacja zaktualizowanej wartości netto w problemach rozdziału zasobów - przegląd modeli i algorytmów

Józefowska, J.; Mika, M.; Różycki, R.; Waligóra, G.; Węglarz, J.

Artykuł - szczegóły

Tytuł artykułu

Maksymalizacja zaktualizowanej wartości netto w problemach rozdziału zasobów - przegląd modeli i algorytmów

Autorzy

Józefowska J. , Mika M. , Różycki R. , Waligóra G. , Węglarz J.

Identyfikatory

Warianty tytułu

Maximization of the net present value in project scheduling - a survey

Konferencja

XIIIKrajowa Konferencja Automatyzacji Procesów Dyskretnych

Języki publikacji

Abstrakty

Rozważane są problemy rozdziału zasobów z kryterium maksymalizacji zaktualizowanej wartości netto. Praca zawiera przegląd modeli i algorytmów dotyczących rozważanej klasy problemów szeregowania i jednocześnie jest próbą podsumowania aktualnego stanu badań w tym zakresie oraz ukazania na tym tle nowych kierunków badawczych.

Project scheduling problems with the maximization of the net present value (NPV) criterion are considered. The paper surveys models and algorithms concerning this class of problems. The state-of-the-art in this area and the future research directions are presented.

Słowa kluczowe

szeregowanie zadań rozdział zasobów wartość netto

Wydawca

Wydawnictwo Politechniki Śląskiej

Czasopismo

Zeszyty Naukowe. Automatyka / Politechnika Śląska

Rocznik

2002

Tom

z. 134

Strony

243--254

Opis fizyczny

Bibliogr. 54 poz.

Twórcy

autor

Józefowska J.

Politechnika Poznańska, Poznań

autor

Mika M.

Politechnika Poznańska, Poznań

autor

Różycki R.

Politechnika Poznańska, Poznań

autor

Waligóra G.

Politechnika Poznańska, Poznań

autor

Węglarz J.

Politechnika Poznańska, Poznań

Bibliografia

1. 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.
2. Baroum S.M., Patterson J.H.: An Exact solution procedure for maximizing the net present value of cash flows in a network. w: Project scheduling: Recent models, algorithms and applications. (Węglarz J. - red.), Kluwer, 1999, 107-134.
3. Bartusch M., Mohring R., Radermacher F.J.: Scheduling project networks with resource constraints and time Windows. Annals of Operations Research.
4. Bianco L., Dell’Olmo P., Speranza M.G.: Heuristics for multimode scheduling problems with dedicated resources. EJOR, 107, 1998, 260-271.
5. Błażewicz J., Cellary W., Słowiński J., Węglarz J.: Scheduling under resource constraints - deterministic models. Baltzer, Basel, 1986.
6. Bottcher J., Drexl A., Kolisch R., Salewski F.: Project scheduling under partially renewable resource constraints. Management Science, 45, 1999, 543-559.
7. Brucker P., Drexl A., Mohring R., Neumann K., Pesch E.: Resource-constrained project scheduling: Notation, classification, models and methods. EJOR, 112,1999, 3-41.
8. Dayanand N., Padman R.: On modeling payments in projects. Journal of the Operational Research Society, 48,1997, 906-918.
9. Demeulemeester E.L., Herroelen W.S.: A branch-and-bound procedure for the generalized resource-constrained project scheduling problem. Operations Research, 45, 1997, 201¬212.
10. Doersch R.H., Patterson J.H.: Scheduling a project to maximize its net present value: A zero-one programming approach. Management Science, 23, 1977, 882-889.
11. Elmaghraby S.E.: Activity nets: A guided tour through some recent developments. EJOR, 64, 1995, 199-215.
12. Elmaghraby S.E., Herroelen W.S.: The scheduling of activities to maximize the net present value of projects, European Journal of Operational Research, 49, 1990, 35-49.
13. Etgar R., Shtub A., LeBlanc L.J.: Scheduling projects to maximize net present value -the case of time-dependent, contingent cash flows. EJOR, 96,1997, 90-96.
14. Erengüç S.S., Tufekci S., Zappe C.: The solution of the time/cost tradeoff problem with discounted cash flows using generalized Benders decomposition. Naval Research Logistics, 40, 1993, 25-50.
15. Grinold R.C.: The payment scheduling problem. Naval Research Logistics, 19, 1972, 123136.
16. Herroelen W.S., Gallens E.: Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects. EJOR, 65, 1993, 274-277.
17. Herroelen W.S., Van Dommelen P., Demeulemeester E.L.: Project network models with discounted cash flows a guided tour through recent developments. EJOR, 100, 1997, 97121.
18. Herroelen W.S., Van Dommelen P., Demeulemeester E.L.: Resource-constrained project scheduling: A survey on recent developments. Computers and Operations Research, 25, 1998, 279-302.
19. Icmeli O., Erengüç S.S.: A tabu search adaptation to resource constrained project scheduling problem with discounted cash flows. Computers and Operations Research, 21, 1994, 841-854.
20. 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.
21. Icmeli O., Erengüç S.S.: The resource constrained time/cost tradeoff project scheduling problem with discounted cash flows. Journal of Operations Management, 14, 1996, 255-275.
22. Icmeli O., Erengüç S.S., Zappe C.J.: Project scheduling problems: A survey. International Journal of Operations & Production Management, 13, 1993, 80-91.
23. Kazaz B., Sepil C.: Project scheduling with discounted cash flows and progress payments. Journal ofthe Operational Research Society, 42,1996,1262-1272.
24. Kimms A.: Mathematical Programming and Financial Objectives for Scheduling Projects.
25. Kolisch R., Padman R.: An integrated survey of deterministic project scheduling. Omega - The International Journal of Management Science, 29, 2001, 249-272
26. Kolisch R., Sprecher A.: PSPLIB - A project scheduling problem library. European Journal of Operational Reasearch, 96, 1997,205-216.
27. Neumann K., Zimmermann J,: Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. EJOR, 127,2000,425-443.
28. Őzdamar L., Dtindar H.: A flexible heuristic for a multi-mode Capital constrained project scheduling problem with probabilistic cash inflows. Computers & Operations Research, 24,1997,1187-1200.
29. Őzdamar L., Ulusoy G.: A survey on the resource-constrained project scheduling problem. IIE Transactions, 27, 1995, 574-586.
30. Padman R., Smith-Daniels D.E.: Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach. EJOR, 64, 1993, 295-311.
31. 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.
32. Patterson J.H.: A comparison of exact approaches for solving the multiple-constrained resource, project scheduling problem. Management Science, 30, 1984, 854-867.
33. 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.
34. De Reyck B., Herroelen W.S.: An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. Computers and Operations Research, 25,1998,1-17.
35. Russell A.H.: Cash flows in networks. Management Science, 16, 1970, 357-373.
36. Russell R.A.: A comparison of heuristics for scheduling projects with cash flows and resource restrictions. Management Science, 32, 1986,1291-1300.
37. Salewski F., Schrimer A., Drxl A.: Project scheduling under resource and mode identity constraints: Model, complexity, methods, and applications. EJOR, 102, 1997, 88-110.
38. Schwindt Ch., Zimmermann J.: A steepest ascent approach to maximizing the net present value of projects. Mathematical Methods of Operations Research, 53, 2001, 435-450.
39. Sepil C.: Comment on Elmaghraby’s and Herroelen’s The scheduling of activities to maximize the net present value of projects. EJOR, 73, 1994, 185-187.
40. Sepii C., Ortaç N.: Performance of the heuristic procedures for constrained projects with progress payments. Journal of the Operational Research Society, 48, 1997, 1123-1130.
41. 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.
42. 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.
43. Smith-Daniels D.E., Padman R., Smith-Daniels V.L.: Heuristic scheduling of Capital constrained projects. Journal of Operations Management, 14,1996,241-254.
44. 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.
45. Sprecher A.: Resource-constrained project scheduling: Exact methods for the multi-mode case. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin 1996.
46. Sung C.S., Lim S.K.: A project activity scheduling problem with net present value measure. International Journal of Production Economics, 37, 1995, 177-187.
47. Ulusoy G., Cebelli S.: An equitable approach to the payment scheduling problem in project management. EJOR, 127, 2000, 262-278.
48. Ulusoy G., Sivrikaya-Şerifoğlu F., Şahin S.: Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows. Annals of Operations Research, 102, 2001, 237-261.
49. Vanhoucke M., Demeulemeester E.L., Herroelen W.S.: Maximizing the net present value of a project with linear time-dependent cash flows. International Journal of Production Research, 39, 2001, 3159-3181.
50. Vanhoucke M., Demeulemeester E.L., Herroelen W.S.: On maximizing the net present value of a project under renewable resource constraints. Management Science, 47, 2001, 1113-1121.
51. Węglarz J.: Project scheduling with continuously divisible doubly-constrained resources. Management Science, 27, 1981, 1040-1053.
52. Yang K.K., Talbot F.B., Patterson J.H.: Scheduling a project to maximize its present value: An integer programming approach. EJOR, 64, 1993, 188-198.
53. Yang K.K., Tay L.C., Sum C.C.: A comparison of stochastic scheduling rules for maximizing project net present value. EJOR, 85, 1995, 327-339.
54. Zhu D., Padman R.: A metaheuristic scheduling procedure for resource-constrained projects with cash flows. Naval Research Logistics, 46, 1999, 912-927.

Typ dokumentu

Bibliografia

Identyfikator YADDA

bwmeta1.element.baztech-article-BSL6-0008-0004