Procedure: 𝑁 𝑆 𝑆 3
𝑖 = 1
while  i ≤ n do
  𝑗 = 𝑗 + 1
 while   𝑗 ≤ 𝑛   do
  select randomly two jobs p and q from the current solution 𝑥
   𝑥 = swap the two selected jobs on their positions
  if  Z( 𝑥 ) < Z(x) do
    𝑥 = 𝑥
    𝑗 = 𝑛
    𝑖 = 𝑛
  end  if
   𝑗 = 𝑗 + 1
 end  while
  𝑖 = 𝑖 + 1
end  while
Algorithm 3: Procedure of neighborhood structure N S S 3 .