| Article ID: | iaor19982710 |
| Country: | United Kingdom |
| Volume: | 48 |
| Issue: | 7 |
| Start Page Number: | 751 |
| End Page Number: | 755 |
| Publication Date: | Jul 1997 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Islam A., Eksioglu M. |
| Keywords: | heuristics |
In this paper, a tabu search approach is proposed for solving the single machine mean tardiness scheduling problem. Simulation experiment results obtained from the tabu search approach and three other heuristics are compared. Although computation time is increased, the results indicate that the proposed approach provides a much better solution than the other three approaches.