A new scheduling technique for the resource-constrained project scheduling problem with discounted cash flows

In this paper, we discuss the resource-constrained project scheduling problem with discounted cash flows. We introduce a new schedule construction technique which moves sets of activities to improve the project net present value and consists of two steps. In particular, the inclusion of individual activities into sets, which are then moved together, is crucial in both steps. The first step groups the activities based on the predecessors and successors in the project network, and adds these activities to a set based on their finish time and cash flow. The second step on the contrary does so based on the neighbouring activities in the schedule, which may but need not include precedence related activities. The proposed scheduling method is implemented in a genetic algorithm metaheuristic and we employ a penalty function to improve the algorithm's feasibility with respect to a tight deadline. All steps of the proposed solution methodology are tested in detail and an extensive computational experiment shows that our results are competitive with existing work