| Article ID: | iaor20051324 |
| Country: | United Kingdom |
| Volume: | 55 |
| Issue: | 7 |
| Start Page Number: | 780 |
| End Page Number: | 784 |
| Publication Date: | Jul 2004 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Shutler Paul M.E. |
| Keywords: | production, heuristics |
Following a recent paper by the same author, a priority list-based tabu search heuristic is compared with the leading schedule-based tabu search heuristic of Nowicki and Smutnicki. More search neighbourhoods are required to achieve a given average makespan, but each priority list neighbourhood is searched much faster than the corresponding neighbourhood in the space of feasible schedules. Priority list-based tabu search therefore outperforms schedule-based tabu search in terms of elapsed CPU time.