A heuristic solution procedure to minimize nT on a single machine

In this paper, a heuristic procedure utilizing the adjacent pairwise interchange (API) methodology to minimize mean tardiness (nT) in single-machine scheduling is presented. Results indicate that it provides a much better solution than does the Wilkerson-Irwin heuristic algorithm, which also tries to minimize nT. Experimental results suggest that the heuristic solution is not affected by problem size, which is important if larger problems are to be solved. Also, the heuristic is not affected by the tightness of due dates.