A Hybrid Multiobjective Evolutionary Approach for Flexible Job-Shop Scheduling Problems

Algorithm 4

Procedure of local search.

Procedure: Local search

for   𝑖=0 to popsize   do

  Ind 𝑖: the 𝑖th individual in the population;

 rank 𝑖: the value of non-domination rank of an individual Ind 𝑖;

 JobNum: the number of job;

 TempInd: a new created temporary individual;

  Copy_Ind(Ind 𝑖, TempInd);

 for   𝑗=0 to JobNum/rank 𝑖   do

  Adjust machine assignment on Ind 𝑖;

  Evaluate Ind 𝑖;

  if   Ind 𝑖 dominates TempInd  then

    break;

  end if

  for  𝑘=0 to JobNum/rank 𝑖  do

    Adjust operation sequence on Ind 𝑖;

    Evaluate Ind 𝑖;

     if  Ind 𝑖 dominates TempInd  then

       break;

     end if

   end for

  if   Ind 𝑖 dominates TempInd  then

    break;

  end if

  if   TempInd dominates Ind 𝑖  then

     Copy_Ind(TempInd, Ind 𝑖);

  end if

 end for

end for