Minimizing total flow-time: The unrelated case

Abstract

We consider the problem of minimizing flow-time in the unrelated machines setting. We introduce a notion of (α,β) variability to capture settings where processing times of jobs on machines are not completely arbitrary and give an O(βlogα) approximation for this setting. As special cases, we get (1) an O(k) approximation when there are only k different processing times (2) an O(logP)-approximation if each job can only go on a specified subset of machines, but has the same processing requirement on each such machine. Further, the machines can have different speeds. Here P is the ratio of the largest to the smallest processing requirement, (3) an - approximation algorithm for unrelated machines if we assume that our algorithm has machines which are an ε-factor faster than the optimum algorithm's machines. We also improve the lower bound on the approximability for the problem of minimizing flow time on parallel machines from to Ω(log 1∈-∈ε P) for any ε>∈0. © 2008 Springer Berlin Heidelberg.