| Article ID: | iaor1992950 |
| Country: | Netherlands |
| Volume: | 47 |
| Issue: | 1 |
| Start Page Number: | 65 |
| End Page Number: | 74 |
| Publication Date: | Jul 1990 |
| Journal: | European Journal of Operational Research |
| Authors: | Taillard E. |
| Keywords: | programming: integer |
In this paper the best heuristic methods known up to now are compared to solve the flow shop sequencing problem and the complexity of the best one is improved. Next, this problem is applied to taboo search, a new technique to solve combinatorial optimization problems, and computational experiments are reported. Finally a parallel taboo search algorithm is presented and experimental results show that this heuristic allows very good speed-up.