An optimal algorithm for preemptive on-line scheduling

Authors:
Bo Chen;André Van Vliet;Gerhard J. Woeginger
Affiliations:
Warwick Business School, University of Warwick, Coventry CV4 7AL, UK;Econometric Institute, Erasmus University Rotterdam, 3000 DR Rotterdam, Netherlands;TU Graz, Institut für Mathematik, Kopernikusgasse 24, A-8010 Graz, Austria
Venue:
Operations Research Letters
Year:
1995

Citing 1
Cited 23

`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)

Resource Augmentation in Load Balancing

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Preemptive semi-online scheduling with tightly-grouped processing times

Journal of Computer Science and Technology
2005: an offline persepctive

ACM SIGACT News
Optimal semi-online preemptive algorithms for machine covering on two uniform machines

Theoretical Computer Science
Preemptive online scheduling: optimal algorithms for all speeds

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Preemptive scheduling on a small number of hierarchical machines

Information and Computation
A Lower Bound for the On-Line Preemptive Machine Scheduling with lpNorm

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Optimal and online preemptive scheduling on uniformly related machines

Journal of Scheduling
Max-min online allocations with a reordering buffer

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Robust algorithms for preemptive scheduling

ESA'11 Proceedings of the 19th European conference on Algorithms
Preemptive Online Scheduling with Reordering

SIAM Journal on Discrete Mathematics
Preemptive semi-online scheduling on parallel machines with inexact partial information

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A lower bound for on-line scheduling on uniformly related machines

Operations Research Letters
Preemptive on-line scheduling for two uniform processors

Operations Research Letters
Semi-online scheduling with decreasing job sizes

Operations Research Letters
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios

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

Operations Research Letters
Randomized on-line scheduling on three processors

Operations Research Letters
Optimal preemptive semi-online scheduling to minimize makespan on two related machines

Operations Research Letters
On the value of job migration in online makespan minimization

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Recent advances for a classical scheduling problem

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of on-line scheduling jobs on m identical parallel machines where preemption is allowed. The goal is to minimize the makespan. We derive an approximation algorithm with worst-case guarantee m^m/(m^m - (m - 1)^m) for every m = 2, which increasingly tends to e/(e - 1) ~ 1.58 as m - ~. Moreover, we prove that for no m = 2 there does exist any approximation algorithm with a better worst-case guarantee.