| Article ID: | iaor19992527 |
| Country: | United Kingdom |
| Volume: | 49 |
| Issue: | 12 |
| Start Page Number: | 1296 |
| End Page Number: | 1302 |
| Publication Date: | Dec 1998 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Moccellin J.V., Nagano M.S. |
| Keywords: | scheduling |
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.