A tabu search approach for the flow shop
โ
M. Ben-Daya; M. Al-Fawzan
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 788 KB
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