An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem

Abstract

In this paper, an efficient tabu search algorithm is prepared ibr solving the singlemachine mean tardiness problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighbourhoods of a given sequence and a combined scheme for intensification and diversification. The tabu search method is shown to produce results very close to the optimal solution using randomly generated problems with varying degrees of difficulty.