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

Algorithm 3

Repair strategy for interchange operation.

Step  1. Initialize, 𝐹=Φ,𝐷=Φ;

Step  2. From 𝑗 = position 1 to 𝑃₁, update 𝐹 and 𝐷;

Step  3. 𝑑=𝑃₁;

Step  4. From 𝑑 to 𝑃₂, if 𝑆(𝑑) is not in 𝐷, search from 𝑢=𝑑+1 to 𝑃₂ until 𝑆(𝑢)∈𝐷;

Step  5. put 𝑆(𝑢) in 𝑑 and from 𝑦=𝑢−1 to 𝑑 put 𝑆(𝑦+1)=𝑆(𝑦);

Step  6. add 𝑆(𝑑) to 𝐹 and update 𝐷;

Step  7. 𝑑=𝑑+1, if 𝑑>𝑃₂, Stop; else go to Step  4.