Departmental Papers (CIS)

Document Type

Conference Paper

Date of this Version

July 2001

Comments

Copyright ACM, 2001. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pages 84-93.
Publisher URL: http://doi.acm.org/10.1145/380752.380778

Abstract

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.

Share

COinS
 

Date Posted: 10 March 2005

This document has been peer reviewed.