A comparison of tabu search and local search methods for single machine scheduling with ready time

Abstract

Tabu search and local search are based on a neighborhood structure. In this paper, in order to examine the optimal performance of these algorithms, these techniques are applied to the single machine sequencing problem with ready times which is known NP-hard problem. Rased on the results of extensive computational tests, the tabu search algorithm with insert structure and local search algorithm with combined insert and swap neighborhood structure under initial solution generated by special heuristic HI are found to generate better quality solution than that of other algorithms However, the results also indicate that local search with combined insert and swap neighborhood structure under randomly generated initial solution also generates better results which is comparable to the three benchmark heuristics in opiimaiity performance.