%0 Journal Article
%A GH. Moslehi and H. Ghahar,
%T A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
%J Journal of Computational Methods In Engineering
%V 25
%N 2
%U http://jcme.iut.ac.ir/article-1-389-en.html
%R
%D 2007
%K Project scheduling problems, Net present value, Differential procedure, Recursive search procedure, Cash flow,
%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.
%> http://jcme.iut.ac.ir/article-1-389-en.pdf
%P 11-30
%& 11
%!
%9 Research
%L A-10-2-368
%+
%G eng
%@ 2228-7698
%[ 2007