Article ID: | iaor19992901 |
Country: | Netherlands |
Volume: | 109 |
Issue: | 1 |
Start Page Number: | 88 |
End Page Number: | 95 |
Publication Date: | Aug 1998 |
Journal: | European Journal of Operational Research |
Authors: | Ben-Daya M., Al-Fawzan M.A. |
Keywords: | heuristics |
In this paper, we propose a tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification that has not been considered before. These new features result in an implementation that improves upon previous tabu search implementations that use mechanisms of comparable simplicity. Also, better results were obtained than those produced by a simulated annealing algorithm from the literature.