Synergy of Genetic Algorithm with Extensive Neighborhood Search for the Permutation Flowshop Scheduling Problem

Algorithm 1

Pseudocode for makespan calculation.

 for to

  for to

   if then

    span = span

   else

    span[j] = max(span, span) +

   end if

  end for

 end for

  = span[]