A Hybrid Algorithm for the Permutation Flowshop Scheduling Problem without Intermediate Buffers

Algorithm 1

Main procedure of the proposed hybrid algorithm.

Generate an initial solution , and set the neighborhoods based on job-block ()

(, )        //perform local search

Add the improved solution into

while the termination criterion is not reached do

  while    do

          //generate a new solution from

    , )    //perform local search to

    if       //update solution and neighborhood

    else

    end if

          //update R

  end while

end while