Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 88-95 |
| Number of pages | 8 |
| Journal | European Journal of Operational Research |
| Volume | 109 |
| Issue number | 1 |
| DOIs | |
| State | Published - 16 Aug 1998 |
Bibliographical note
Funding Information:The authors are grateful to an anonymous referee for very constructive comments that helped improve the presentation of the paper tremendously. They would like also to acknowledge the support of the King Fahd University of Petroleum and Minerals.
Keywords
- Flow shop scheduling
- Heuristics
- Tabu search
ASJC Scopus subject areas
- General Computer Science
- Modeling and Simulation
- Management Science and Operations Research
- Information Systems and Management