Evaluating the performance of tabu search procedures for flow shop sequencing

Abstract

We address the problem of minimising makespan in a flow shop by using tabu search procedures. By combining different neighbourhood structures, neighbourhood examinations, and stopping conditions we obtain alternative tabu search procedures. Starting from a common initial solution we evaluate the relative performance of such procedures considering both the solution quality and computational effort.

Keywords:

• flow shop sequencing
• heuristics
• tabu search