ACS Applied Computer Science

  • Increase font size
  • Default font size
  • Decrease font size

PRIORITY ALGORITHMS FOR THE PROBLEM OF FINANCIAL OPTIMISATION OF A MULTI STAGE PROJECT

Print
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 techniques 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.
  • APA 6th style
Klimek, M. (2017). Priority algorithms for the problem of financial optimisation of a multi stage project. Applied Computer Science, 13(4), 20-34. doi:10.23743/acs-2017-26
  • Chicago style
Klimek, Marcin. "Priority Algorithms for the Problem of Financial Optimisation of a Multi Stage Project." Applied Computer Science 13, no. 4 (2017): 20-34.
  • IEEE style
M. Klimek, "Priority algorithms for the problem of financial optimisation of a multi stage project," Applied Computer Science, vol. 13, no. 4, pp. 20-34, 2017.
  • Vancouver style
Klimek M. Priority algorithms for the problem of financial optimisation of a multi stage project. Applied Computer Science. 2017;13(4):20-34.