A tabu search heuristic with variable neighborhood for flow shop scheduling problem with limited buffer storage

  • Guo- qiang Qu
  • Published 2011 in
    2011 2nd International Conference on Artificial…
This paper explored NP-hard flow shop scheduling problem with limited buffer storage. A tabu search heuristic with variable neighborhood was proposed. An initial seed solution was created by NEH heuristic. Then a restart mechanism was proposed to escape from it after been traped into local optimal. The performance of the algorithm is tested on Rec, hel1 and… CONTINUE READING