Isfahan University of TechnologyJournal of Computational Methods in Engineering2228769825220221231A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present ValueA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value11302944FAGH. Moslehi And H. GhaharJournal Article20221231This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have been generated. We have compared both the total time for solving the problem and NPV of the Dif_AOA with those of the recursive search procedure. Computational results show that the Dif_AOA performs very effectively.
Extensive analysis have been performed to evaluate the node number, complexity network coefficients(CNC), and deadline.This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have been generated. We have compared both the total time for solving the problem and NPV of the Dif_AOA with those of the recursive search procedure. Computational results show that the Dif_AOA performs very effectively.
Extensive analysis have been performed to evaluate the node number, complexity network coefficients(CNC), and deadline.https://jcme.iut.ac.ir/article_2944_c658b8e2e6fc176647342b64decca063.pdf