Article ID: | iaor20072269 |
Country: | United Kingdom |
Volume: | 33 |
Issue: | 9 |
Start Page Number: | 2623 |
End Page Number: | 2644 |
Publication Date: | Sep 2006 |
Journal: | Computers and Operations Research |
Authors: | Howe Adele E., Watson Jean-Paul, Whitley L. Darrell |
Keywords: | heuristics: tabu search |
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art performance levels on a range of academic and real-world problems. Yet, despite these successes, remarkably little research has been devoted to developing an understanding of why tabu search is so effective on this problem class. In this paper, we report results that provide significant progress in this direction. We consider Nowicki and Smutnicki's