Search published articles


Showing 1 results for Project Scheduling Problems

Gh. Moslehi and H. Ghahar,
Volume 25, Issue 2 (1-2007)
Abstract

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.

Page 1 from 1     

© 2024 CC BY-NC 4.0 | Journal of Advanced Materials in Engineering (Esteghlal)

Designed & Developed by : Yektaweb