论文信息 - Better Algorithms for Minimizing Average Flow-Time on Related Machines

Better Algorithms for Minimizing Average Flow-Time on Related Machines

We consider the problem of minimising flow time on related machines and give an O(logP)-approximation algorithm for the offline case and an O(log2P)-competitive algorithm for the online version. This improves upon the previous best bound of O(log2P logS) on the competitive ratio. Here P is the ratio of the maximum to the minimum processing time of a job and S is the ratio of the maximum to the minimum speed of a machine.

Amit Kumar | Naveen Garg

[1] Yossi Azar,et al. Minimizing the flow time without migration , 1999, STOC '99.

[2] Stefano Leonardi,et al. Approximating total flow time on parallel machines , 1997, STOC '97.

[3] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4] Sanjeev Khanna,et al. Algorithms for minimizing weighted flow time , 2001, STOC '01.

[5] Amit Kumar,et al. Minimizing average flow time on related machines , 2006, STOC '06.

[6] Yossi Azar,et al. Minimizing total flow time and total completion time with immediate dispatching , 2003, SPAA.

[7] Michel X. Goemans,et al. Improved approximation algorthims for scheduling with release dates , 1997, SODA '97.