Minimizing average flow time on unrelated machines

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