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

Algorithm 4

Procedure of interchange operation.

Step  1. Generate randomly two position 𝑃₁ and 𝑃₂∈[1,𝑁];

Step  2. If:

     swapping two activities 𝑆(𝑃₁) and 𝑆(𝑃₁) without producing infeasible schedule, go to Step  3;

    Else:

     execute the Repair strategy.

Step  3. interchange two activities’ positions.