A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Efficient Algorithms for Average Completion Time Scheduling
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
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.
doi:10.1007/978-3-642-13036-6_31
fatcat:xj4j57favjabzpky5iwicuhosu