A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

Algorithm 3

The basic flowchart of IIS local search.

For 𝑖=1∶𝑛 (𝑛 is the number of job);

  For each job in the job sequence after 𝑖;

     change the position with the job after itself;

     compute the makespan of the new job sequence;

     replace the original individual by the improved offspring individual;

  End for

End for