Title :
Efficient method for single machine total tardiness problem
Author_Institution :
Kharkiv Nat. Univ. of Econ., Kharkiv, Ukraine
Abstract :
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.
Keywords :
graph theory; minimisation; single machine scheduling; minimization; shortest Hamiltonian path; single machine total tardiness problem; unweighted total tardiness problem; weighted total tardiness problem; Hamiltonian path; NP-hard; dominance rule; due dates; error; graph; total tardiness;
Conference_Titel :
Problems of Cybernetics and Informatics (PCI), 2012 IV International Conference
Conference_Location :
Baku
Print_ISBN :
978-1-4673-4500-2
DOI :
10.1109/ICPCI.2012.6486283
