Dominance and decomposition heuristics for single machine scheduling

New heuristic dominance rules and a flexible decomposition heuristic are developed for the problem of minimizing weighted tardiness on a single processor. Extensive computational experience demonstrates that, when the present new heuristic dominance rules were incorporated into an optimal algorithm, optimal or nearly optimal solutions were obtained quickly. In fact, solution times were orders of magnitude faster than those using the optimal algorithm alone. On larger problems, the present decomposition heuristic obtained better solutions than previous heuristics. Furthermore, on 50-job problems the decomposition heuristic obtained an optimal solution over ten times more often on the average than the best competing heuristic (22% versus 2% of the time). Since both the present approaches are basically relaxations of optimal solution algorithms, they could easily be adapted for use in the solution of other scheduling problems.