A Novel Memetic Algorithm Based on Decomposition for Multiobjective Flexible Job Shop Scheduling Problem

Algorithm 1

Framework of the proposed MOMAD.

Generate a set of weight vectors

Generate weight vector groups

Get the neighborhood of each weight vector , , where are the

closest weight vectors to  .

   Initialize the population

Initialize Idealpoint:  

Find the non-dominated solutions in initial population to construct the archive

  while the termination criterion is not satisfied  do

for    do

if    then

else

end if

Randomly select two different indexes , from , ()

GeneticOperators

UpdateIdealPoint (, )

Objective Normalization

Update Current Population

Update External Archive

end for

LocalSearch()

 end while