A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time

Algorithm 1

Search process of canonical VNS.

)    Input: initial solution , a set of candidate neighborhoods ,

()    Set the iteration number  .

()    while  

()       

()       while    do

()            //a random solution is generated in neighborhood

()            //improve in neighborhood and get new solution

()        if   is better than

()          

()                         //next search will start from the first neighborhood

()        else

()                    //next neighborhood is selected

()        end if

()       end while

()        

() end while