A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
2015
Algorithmica
In this paper we initiate the study of job scheduling on related and unrelated machines so as to minimize the maximum flow time or the maximum weighted flow time (when each job has an associated weight). Previous work for these metrics considered only the setting of parallel machines, while previous work for scheduling on unrelated machines only considered Lp, p < ∞ norms. Our main results are: (i) We give an O(ε −3 )-competitive algorithm to minimize maximum weighted flow time on related
doi:10.1007/s00453-015-0082-y
fatcat:oxjfxyqzdfejxciazfmgkyeofm