Priority algorithms for the problem of financial optimisation of a multi-stage project

• Autorzy: Klimek M.

Identyfikatory

DOI

10.23743/acs-2017-26

• Języki publikacji: EN

Abstrakty

EN

The article presents the problem of the financial optimisation of a multi-stage project from the contractor's perspective, where customer's payments are analysed as a cash inflow (contractor's revenues) after completing contractual stages and contractor's expenses incurred for the activities executed. In order to solve the problem, priority algorithms are proposed: single-pass and multi-pass ones, using different priority rules and tech-niques for generating solutions dedicated to the investigated optimisation model. The article presents a comparison of the effectiveness of individual algorithms in the case of adequately prepared test problems.

Słowa kluczowe

EN

resource-constrained multi-stage project scheduling; discounted cash flows; milestones; priority algorithms

PL

ograniczone zasoby; planowanie projektu; zdyskontowane przepływy pieniężne; kamienie milowe; algorytmy priorytetowe

• Wydawca: Polskie Towarzystwo Promocji Wiedzy ; Lublin University of Technology
• Czasopismo: Applied Computer Science
• Rocznik: 2017
• Tom: Vol. 13, no 4
• Strony: 20--34
• Opis fizyczny: Bibliogr. 16 poz., fig., tab.

Twórcy

autor

Klimek M.

• State School of Higher Education, Department of Computer Science, Sidorska 95-97, Biala Podlaska

Bibliografia

• 1. Błażewicz, J., Lenstra, J., & Kan, A. (1983). Scheduling subject to resource constraints classi-fication and complexity. Discrete Applied Mathematics, 5, 11–24.
• 2. Hartmann, S., & Briskorn, D. (2012). A Survey of Variants and Extensions of the Resource-Constrained Project Scheduling Problem. European Journal of Operational Research, 207(1), 1–14.
• 3. Hartmann, S., & Kolisch, R. (2000). Experimental evaluation of state-of-the-art heuristics for the re-source-constrained project scheduling problem. European Journal of Operational Research, 127, 394–407.
• 4. He, Z., Wang, N., Jia, T., & Xu, Y. (2009). Simulated annealing and tabu search for multimode project payment scheduling. European Journal of Operational Research, 198(3), 688–696.
• 5. Józefowska, J., & Węglarz, J. (eds.) (2006). Perspectives in modern project scheduling. Springer.
• 6. Klimek, M. (2010). Predyktywno-reaktywne harmonogramowanie produkcji z ograniczoną dostępnością zasobów, PhD disertation, AGH, Cracow. (in Polish)
• 7. Klimek, M., & Łebkowski, P. (2015a) Harmonogramowanie projektu rozliczanego etapowo. AGH, Cracow. (in Polish)
• 8. Klimek, M., & Łebkowski, P. (2015b). Heuristics for project scheduling with discounted cash flows optimisation. Bulletin of the Polish Academy of Sciences Technical Sciences, 63(3), 613–622.
• 9. Kolisch, R. (1996a). Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90, 320–333.
• 10. Kolisch, R. (1996b). Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management, 14, 179–192.
• 11. Kolisch, R., & Hartmann, S. (2006). Experimental Investigation of Heuristics for Resource-Constrained Project Scheduling: An Update. European Journal of Operational Research, 74(1), 23–37.
• 12. Kolisch, R., & Sprecher, A. (1997). PSPLIB – a project scheduling library. European Journal of Operational Research, 96, 205–216.
• 13. Mika, M., Waligóra, G., & Węglarz, J. (2005). Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. European Journal of Operational Research, 164(3), 639–668.
• 14. Ulusoy, G., Sivrikaya-Serifoglu, F., & Sahin, S. (2001). Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows. Annals of Operations Research, 102, 237–261.
• 15. Valls, V, Ballestin, F, & Quintanilla, S. (2005). Justification and RCPSP: a technique that pays. European Journal of Operational Research, 165(2), 375–386.
• 16. Vanhoucke, M. (2006). A scatter search procedure for maximizing the net present value of a resource-constrained project with fixed activity cash flows. Working Paper 2006/417, Gent, 1–23.

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017)