@inproceedings{f9db6b06f97042039f7132ac54416aa8,
title = "Minimizing average flow time on unrelated machines",
abstract = "We give an O(Q)-approximation for minimizing average flow time on unrelated machines, where Q is the maximum number of different process times on a machine. Consequently, the ratio is O(logP/loge) if all process times are a power of e. Here, P is the ratio of the maximum and minimum process time of a job.",
author = "R.A. Sitters",
year = "2009",
doi = "10.1007/978-3-540-93980-1\_6",
language = "English",
isbn = "978-3-540-93979-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "67--77",
editor = "E. Bampis and M. Skutella",
booktitle = "Approximation and Online Algorithms (6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers)",
address = "Germany",
}