Minimizing Average Flow Time on Unrelated Machines

Authors:
René A. Sitters
Affiliations:
Technische Universiteit Eindhoven,
Venue:
Approximation and Online Algorithms
Year:
2009

Citing 11
Cited 0

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
Minimizing average flow time on related machines

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of mean flow time scheduling problems with release times

Journal of Scheduling
Approximating total flow time on parallel machines

Journal of Computer and System Sciences
Minimizing Average Flow-time: Upper and Lower Bounds

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Approximability of Average Completion Time Scheduling on Unrelated Machines

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Minimizing Total Flow-Time: The Unrelated Case

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Complexity of preemptive minsum scheduling on unrelated parallel machines

Journal of Algorithms
Better algorithms for minimizing average flow-time on related machines

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Minimizing flow time on a constant number of machines with preemption

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an O(Q)-approximation for minimizing average flow time on unrelated machines, where Q is the maximum number of different process times on a machine. Consequently, the ratio is O(logP/logε) if all process times are a power of ε. Here, P is the ratio of the maximum and minimum process time of a job.