A Scatter Search Algorithm for RCPSP with discounted weighted earliness-tardiness costs

In this paper, we study a resource-constrained project scheduling problem in which a set of project activities have due dates. If the finish time of each one of these activities is not equal to its due date, an earliness or a tardiness cost exists for each tardy or early period. The objective is to minimize the sum of discounted weighted earliness-tardiness penalty costs of these activities. Scatter Search algorithm is used to deal with this extended form of resource-constrained project scheduling problem. Our implementation of Scatter Search integrates the advanced methods such as dynamic updating of the reference set and the use of frequency-based memory within the diversification generator. Finally, some small and medium size test problems are examined and the computational results are presented. The computational results show the efficiency of the proposed meta heuristic procedure.