| Article ID: | iaor1999164 |
| Country: | Netherlands |
| Volume: | 91 |
| Issue: | 1 |
| Start Page Number: | 160 |
| End Page Number: | 175 |
| Publication Date: | May 1996 |
| Journal: | European Journal of Operational Research |
| Authors: | Nowicki Eugeniusz, Smutnicki Czeslaw |
| Keywords: | tabu search, flowshop |
A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in the permutation flow shop is presented. The algorithm is based on a tabu search technique with a specific neighborhood definition which employs a block of jobs notion. Computational experiments (up to 500 jobs and 20 machines) show its excellent numerical properties.