An Enhanced Discrete Artificial Bee Colony Algorithm to Minimize the Total Flow Time in Permutation Flow Shop Scheduling with Limited Buffers

Algorithm 5

Procedure of the DABC algorithm.

(1) set parameters NP, d, ds

(2) generate the initial population

(3) = the best solution in the population

(4) while (not termination)

(5)  for (each employed bee)

(6)   apply bestinsert to its solution in the population

(7)  endfor

(8)  for (each onlooker bee)

(9)   apply CLS to the food source found by its employed bee

(10)    update if possible

(11)   endfor

(12)  for (each scout bee)

(13)   produce a food source based on

(14)   put the food source in the population by tournament selection

(15)   update if possible

(16)  endfor

(17) endwhile