We study the problem of minimizing weighted flow time on a single machine in the preemptive setting. We present an O(log2 P)-competitive semi-online algorithm where P is the ratio of the maximum and minimum processing times of jobs in the system. In the offline setting we show that a (2 + ε)-approximation is achievable in quasi-polynomial time. These are the first non-trivial results for the weighted versions of minimizing flow time. For multiple machines we show that no competitive randomized online algorithm exists for weighted flow time. We also present an improved online algorithm for minimizing total stretch (a special case of weighted flow time) on multiple machines.
|Original language||English (US)|
|Number of pages||10|
|Journal||Conference Proceedings of the Annual ACM Symposium on Theory of Computing|
|State||Published - 2001|
|Event||33rd Annual ACM Symposium on Theory of Computing - Creta, Greece|
Duration: Jul 6 2001 → Jul 8 2001
ASJC Scopus subject areas