On-line scheduling to minimize max flow time: an optimal preemptive algorithm

Authors:
Christoph AmbüHl;Monaldo Mastrolilli
Affiliations:
IDSIA Istituto Dalle Molle di Studi sull' Intelligenza Artificiale, Galleria 2, CH-6928 Manno, Switzerland;IDSIA Istituto Dalle Molle di Studi sull' Intelligenza Artificiale, Galleria 2, CH-6928 Manno, Switzerland
Venue:
Operations Research Letters
Year:
2005

Citing 8
Cited 2

Randomized algorithms

Randomized algorithms
Approximability and nonapproximability results for minimizing total flow time on a single machine

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
Flow and stretch metrics for scheduling continuous job streams

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Probabilistic computations: Toward a unified measure of complexity

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
An optimal algorithm for preemptive on-line scheduling

Operations Research Letters

On-line service scheduling

Journal of Scheduling
Minimizing maximum (weighted) flow-time on related and unrelated machines

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the maximum flow time minimization problem of on-line scheduling jobs on m identical parallel machines. When preemption is allowed, we derive an optimal algorithm with competitive ratio 2-1/m. When preemption is not allowed and m=2, we show that the First In First Out heuristic achieves the best possible competitive ratio.