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.
GH. Moslehi and H. Ghahar, (2022). A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value. Journal of Advanced Materials in Engineering (Esteghlal), 25(2), 11-30.
MLA
GH. Moslehi and H. Ghahar. "A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value", Journal of Advanced Materials in Engineering (Esteghlal), 25, 2, 2022, 11-30.
HARVARD
GH. Moslehi and H. Ghahar, (2022). 'A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value', Journal of Advanced Materials in Engineering (Esteghlal), 25(2), pp. 11-30.
VANCOUVER
GH. Moslehi and H. Ghahar, A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value. Journal of Advanced Materials in Engineering (Esteghlal), 2022; 25(2): 11-30.
', './data/jame/coversheet/cover_en.jpg'))
