For the n-job single-machine weighted tardiness problem a priority rule is known, that holds for neighboring jobs in an optimal solution. This rule is exploited as an improvement step for four construction heuristics. Computational results for a large number of test problems up to size 80 and various values of problem parameters show improved results, while the computing times in a standard personal computer remain modest.
