Abstract
We consider the problem of minimising flow time on related machines and give an O(log P)-approximation algorithm for the offline case und an O(log 2 P)-competitive algorithm for the online version. This improves upon the previous best bound of O(log2 P log S) on the competitive ratio. Here P is the ratio of the maximum to the minimum processing time of a job and S is the ratio of the maximum to the minimum speed of a machine. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Garg, N., & Kumar, A. (2006). Better algorithms for minimizing average flow-time on related machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4051 LNCS, pp. 181–190). Springer Verlag. https://doi.org/10.1007/11786986_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
