Abstract
We analyze the competitive ratio of algorithms for minimizing (weighted) average completion time on identical parallel machines and prove that the well-known shortest remaining processing time algorithm (SRPT) is 5/4-competitive w.r.t. the average completion time objective. For weighted completion times we give a deterministic algorithm with competitive ratio 1.791 + o(m). This ratio holds for preemptive and non-preemptive scheduling. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Sitters, R. (2010). Efficient algorithms for average completion time scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6080 LNCS, pp. 411–423). https://doi.org/10.1007/978-3-642-13036-6_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
