Tabu search for the single machine sequencing problem with ready times

The present work considers the reduction of the mean completion time and the makespan in the single machine scheduling problem with ready times. A Tabu-Search-based heuristic procedure is proposed to find the sequence that allows to reach a value of the cost function as close as possible to the global minimum. Computational tests are carried out to compare the performance of the Tabu Search procedure with those of other heuristics. Comparisons are made both in terms of mean completion time and makespan