A heuristic algorithm for minimizing total absolute deviation from distinct due dates on a single machine

In this paper, we present a heuristic algorithm for minimizing total absolute deviation from distinct due dates on a single machine. First, several dominance properties related are established using proof by adjacent pairwise interchanges. Then, a detailed procedure of the proposed algorithm is given. The proposed algorithm is tested on a set of randomly generated problem instances. Results of numerical experiments show that the heuristic algorithm is computationally efficient, and it can obtain a good enough solution within an acceptable time.