Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Minimizing the flow time without migration
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Minimizing average flow time on related machines
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Minimizing Average Flow Time on Unrelated Machines
Approximation and Online Algorithms
Proceedings of the forty-first annual ACM symposium on Theory of computing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Resource augmentation for weighted flow-time explained by dual fitting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
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.