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

XML Persian Abstract Print

Abstract:   (5587 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]   (1171 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25 | Published: 2007/01/15

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.