RT - Journal Article
T1 - A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
JF - iut-jcme
YR - 2007
JO - iut-jcme
VO - 25
IS - 2
UR - http://jcme.iut.ac.ir/article-1-389-en.html
SP - 11
EP - 30
K1 - Project scheduling problems
K1 - Net present value
K1 - Differential procedure
K1 - Recursive search procedure
K1 - Cash flow
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.
LA eng
UL http://jcme.iut.ac.ir/article-1-389-en.html
M3
ER -