%0 Journal Article
%T A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
%J Journal of Computational Methods in Engineering
%I Isfahan University of Technology
%Z 22287698
%A GH. Moslehi and H. Ghahar,
%D 2022
%\ 12/31/2022
%V 25
%N 2
%P 11-30
%! A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
%K Project scheduling problems
%K Net present value
%K Differential procedure
%K Recursive search procedure
%K Cash flow
%R
%X 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.
%U https://jcme.iut.ac.ir/article_2944_c658b8e2e6fc176647342b64decca063.pdf