Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem

View/ Open
Date
2004Dewey
Recherche opérationnelleSujet
Approximation; Scheduling; Total tardinessJournal issue
Journal of SchedulingVolume
7Number
1Publication date
01-2004Article pages
85-91Publisher
SpringerCollections
Metadata
Show full item recordAuthor
Grosso, Andrea
Della Croce, Federico
Paschos, Vangelis