Fast neighborhood search for the single machine total weighted tardiness problem

Most successful heuristics for solving 1||∑wjTj1||∑wjTj are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n3)O(n3) to O(n2)O(n2). We show that this result also improves the complexity of the recently developed dynasearch heuristics.