A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times

In this paper, we present a tabu search algorithm that schedules N jobs to a single machine in order to minimise the maximum lateness of the jobs. The release times, due dates, and sequence-dependent set-up times of the jobs are assumed to exist. We modified the original tabu search method to be suitable for the scheduling problem. The proposed tabu search algorithm is composed of two parts: a MATCS (modified apparent tardiness cost with set-ups) rule for finding an efficient initial solution, and the tabu search method to seek a near optimal solution from the initial solution. The experimental results show that the tabu search algorithm obtains much better solutions more quickly than the RHP (rolling horizon procedure) heuristic suggested by Ovacik and Uzsoy.