Efficient method for single machine total tardiness problem

Method for solving the problem of minimizing the total tardiness of jobs with due dates is considered as a problem of determining shortest Hamiltonian path in the graph. Computational results for random generated instances with up to 150 jobs for unweighted and weighted total tardiness problem show the good performance and the efficiency of the developed method and algorithms.