Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem
Grosso, Andrea; Della Croce, Federico; Paschos, Vangelis (2004), Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem, Journal of Scheduling, 7, 1, p. 85-91. http://dx.doi.org/10.1023/B:JOSH.0000013056.09936.fd
TypeArticle accepté pour publication ou publié
Journal nameJournal of Scheduling
MetadataShow full item record
Abstract (EN)The weakly NP-hard single-machine total tardiness scheduling problem has been extensively studied in the last decades. Various heuristics have been proposed to efficiently solve in practice a problem for which a fully polynomial time approximation scheme exists (though with complexity O(n 7/E)). In this note, we show that all known constructive heuristics for the problem, namely AU, MDD, PSK, WI, COVERT, NBR, present arbitrarily bad approximation ratios. The same behavior is shown by the decomposition heuristics DEC/EDD, DEC/MDD, DEC/PSK, and DEC/WI.
Subjects / KeywordsApproximation; Scheduling; Total tardiness
Showing items related by title and author.
A generalization of König-Egervary graphs and heuristics for maximum independent set problem with improved approximation ratios Paschos, Vangelis; Demange, Marc (1997) Article accepté pour publication ou publié
Baburin, Aleksei; Della Croce, Federico; Gimadi, Edward; Glazkov, Yuri; Paschos, Vangelis (2009) Article accepté pour publication ou publié