SRPT optimally utilizes faster machines to minimize flow time

@inproceedings{Torng2008SRPTOU,
  title={SRPT optimally utilizes faster machines to minimize flow time},
  author={Eric Torng and Jason McCullough},
  booktitle={TALG},
  year={2008}
}
We analyze the shortest remaining processing time (SRPT) algorithm with respect to the problem of scheduling n jobs with release times on m identical machines to minimize total flow time. It is known that SRPT is optimal if m = 1 but that SRPT has a worst-case approximation ratio of Θ(min(log n/m, log Δ)) for this problem, where Δ is the ratio of the length of the longest job divided by the length of the shortest job. It has previously been shown that SRPT is able to use faster machines to… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

Similar Papers

Loading similar papers…