Effective genetic algorithm for resource-constrained project scheduling with limited preemptions

Abstract

In this paper, a specific preemptive resource-constrained project scheduling problem (PRCPSP) with makespan minimization is considered of which each activity could be interrupted at most M times. According to activity requirements and resource availability, resources are allocated to activities in different intervals. A resource-fragment chain is constructed to keep resource states dynamically. The resource allocation problem is transferred to the well-known 0-1 knapsack problem and solved by dynamic programming in pseudo-polynomial time complexity. The schedule enhancement method is developed to further improve the quality of obtained schedules by removing and rescheduling each activity in the activity list. By integrating the resource allocation and the schedule enhancement method, a genetic algorithm is proposed for the considered problem with the objective to minimize makespan. Computational experiments on the standard J30 and J120 sets show that the proposed algorithm is amongst the most competitive algorithms in literature for the pre-emptive cases. \ua9 2011 Springer-Verlag.Peer reviewed: YesNRC publication: Ye