Volume 25, Issue 2 (1-2007)
2007, 25(2): 11-30 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
GH. Moslehi and H. Ghahar. A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value. Computational Methods in Engineering 2007; 25 (2) :11-30
URL: http://jcme.iut.ac.ir/article-1-389-en.html
URL: http://jcme.iut.ac.ir/article-1-389-en.html
Abstract: (4609 Views)
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.
Keywords: Project scheduling problems, Net present value, Differential procedure, Recursive search procedure, Cash flow
