A Backward Approach for Maximizing Net Present Value of Multi-mode Pre-emptive Resource-Constrained Project Scheduling Problem with Discounted Cash Flows Using Simulated Annealing Algorithm (pp. 151-158)

Aidin Delgoshaei, Mohd Khairol Ariffin, B. T. Hang Tuah Bin Baharudin, Zulkiflle Leman
In this article, a backward approach for maximizing net present value (NPV) in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DC) is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in backward mode. A simulated annealing algorithm is developed for solving experimental cases with 50 variables and results are compared with forward serial programming method. The remarkable results demonstrate that the proposed method can effectively improve NPV in MRCPSP-DC while activity splitting is allowed.