We consider a well-known scheduling problem with sequence-dependent setup times. We propose an efficient limitation strategy that speeds up the local search. High speedups are achieved without compromising the solution quality. High quality solutions are obtained in a matter of seconds.