Research Article

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

Algorithm 2

Insertion-based local search.
(1) = a permutation generated randomly
(2)
(3) while ()
(4)  let
(5)  j = the position index of job s in
(6)  
(7)  for to
(8)   add into
(9)  endfor
(10)  for to n
(11)   add into
(12)  endfor
(13)   = the best permutation in W
(14)  if ( is better than )
(15)    
(16)    
(17)  else
(18)   
(19)  endif
(20)   % n
(21) endwhile