Volume 25, Number 2 (1-2007)                   JCME 2007, 25(2): 11-30 | Back to browse issues page


XML Persian Abstract Print


Download citation:
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. JCME. 2007; 25 (2) :11-30
URL: http://jcme.iut.ac.ir/article-1-389-en.html

Abstract:   (806 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.
Full-Text [PDF 447 kb]   (127 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25

Add your comments about this article : Your username or email:
Write the security code in the box

© 2015 All Rights Reserved | Computational Methods in Engineering

Designed & Developed by : Yektaweb