AU - GH. Moslehi and H. Ghahar,
TI - A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
PT - JOURNAL ARTICLE
TA - iut-jame
JN - iut-jame
VO - 25
VI - 2
IP - 2
4099 - http://jame.iut.ac.ir/article-1-389-en.html
4100 - http://jame.iut.ac.ir/article-1-389-en.pdf
SO - iut-jame 2
ABĀ - 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.
CP - IRAN
IN -
LG - eng
PB - iut-jame
PG - 11
PT - Research
YR - 2007