Algorithms for minimizing weighted flow time

C. Chekuri, S. Khanna, A. Zhu

Research output: Contribution to journalConference articlepeer-review


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 languageEnglish (US)
Pages (from-to)84-93
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - 2001
Externally publishedYes
Event33rd Annual ACM Symposium on Theory of Computing - Creta, Greece
Duration: Jul 6 2001Jul 8 2001

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Algorithms for minimizing weighted flow time'. Together they form a unique fingerprint.

Cite this