Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value

@article{Lacerda2022EmpiricalEO,
  title={Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value},
  author={Isac Mendes Lacerda and Eber Assis Schmitz and Jayme Luiz Szwarcfiter and Rosiane de Freitas},
  journal={ArXiv},
  year={2022},
  volume={abs/2207.03330}
}
This paper presents an empirical performance analysis of three project scheduling algorithms dealing with maximizing projects’ net present value with unrestricted resources. The selected algorithms, being the most recently cited in the literature, are: Recursive Search (RS), Steepest Ascent Approach (SAA) and Hybrid Search (HS). The main motivation for this research is the lack of knowledge about the computational complexities of the RS, SAA, and HS algorithms, since all studies to date show… 

References

SHOWING 1-10 OF 28 REFERENCES

A validation of procedures for maximizing the net present value of a project

The idea of maximizing the net present value of the cash flows of a project has gained increasing attention over the past decades. Several solution procedures have been presented in the literature to

A steepest ascent approach to maximizing the net present value of projects

In an experimental performance analysis, the efficiency of the steepest ascent approach is demonstrated and previous solution methods from literature are compared to the algorithm presented in this paper.

On maximizing the net present value of projects under resource constraints

A depth-first branch-and-bound algorithm which makes use of extra precedence relations to solve a number of resource conflicts and a fast recursive search algorithm for the max-npv problem to compute the upper bounds are introduced.

An Efficient Hybrid Search Algorithm for Various Optimization Problems

This paper presents a hybrid recursive search procedure for the project scheduling problem with net present value maximization and compares it with state-of-the-art procedures by means of computational tests.

On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints

A depth-first branch-and-bound algorithm that makes use of extra precedence relations to resolve a number of resource conflicts and a fast recursive search algorithm for the max- npv problem to compute upper bounds are introduced.

An optimal recursive search procedure for the deterministic unconstrained max-nvp project scheduling problem

A new optimal procedure which performs a recursive search on partial tree structures based on the fundamental logic that positive cash flows should be scheduled as early as possible while negative cash flows ought to be scheduledAs late as possible within the precedence constraints is described.

Project Scheduling with Discounted Cash Flows and Progress Payments

In all large scale projects, there correspond cash flows that incur throughout the life of the project. The scheduling of these projects to maximize the present value of the cash flows has been a

A classification scheme for project scheduling

A wide and steadily growing variety of problem types which motivates the introduction of a systematic notation that can serve as a basis for a classification scheme are described.