Algorithms for minimizing weighted flow time
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
We study the problem of minimizing weighted flow time on a single machine in the preemptive setting. We present an O(\log^2 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+\eps)-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.Keywords
This publication has 6 references indexed in Scilit:
- Minimizing the flow time without migrationPublished by Association for Computing Machinery (ACM) ,1999
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation AlgorithmsMathematics of Operations Research, 1997
- Optimal time-critical scheduling via resource augmentation (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- Approximating total flow time on parallel machinesPublished by Association for Computing Machinery (ACM) ,1997
- Approximability and nonapproximability results for minimizing total flow time on a single machinePublished by Association for Computing Machinery (ACM) ,1996
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977