A simulated annealing approach for the one-machine mean tardiness scheduling problem

In this paper we propose a simulated annealing approach for solving the single machine mean tardiness scheduling problem. The results of a simulation experiment indicate that the proposed method provides much better solutions than two heuristics that gave good results in previous studies, More importantly, the solutions obtained are within less than 1% of optimal solutions.