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

Algorithm 1

Bestinsert procedure.

(1) choose unrepeated jobs randomly and let IL =

(2) while (IL is not empty)

(3)  take out the front job s from IL and delete it from IL

(4)   the position index of job s in

(5)  

(6)  for k = 1 to

(7)   add into

(8)  endfor

(9)  for to

(10)    add into W

(11)  endfor

(12)   = the best permutation in

(13)  

(14) endwhile