Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

Algorithm 4

Procedure of neighborhood structure NSS₅.

Procedure: 𝑁𝑆𝑆₅

for  𝑖=1 to φ do

 select two jobs p and q at random from the current solution 𝑥

 𝑥^  = invert partial jobs between job 𝑝 and job 𝑞

 if Z(𝑥^)<𝑍(𝑥) do

  𝑥=𝑥^

 end  if

end  for