Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set

Abstract EN

This paper presents a shuffled frog leaping algorithm (SFLA) for the single-mode resource-constrained project scheduling problem where activities can be divided into equant units and interrupted during processing.

Each activity consumes 0–3 types of resources which are renewable and temporarily not available due to resource vacations in each period.

The presence of scarce resources and precedence relations between activities makes project scheduling a difficult and important task in project management.

A recent popular metaheuristic shuffled frog leaping algorithm, which is enlightened by the predatory habit of frog group in a small pond, is adopted to investigate the project makespan improvement on Patterson benchmark sets which is composed of different small and medium size projects.

Computational results demonstrate the effectiveness and efficiency of SFLA in reducing project makespan and minimizing activity splitting number within an average CPU runtime, 0.521 second.

This paper exposes all the scheduling sequences for each project and shows that of the 23 best known solutions have been improved.