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

Authors:
Leah Epstein;Lene M. Favrholdt
Affiliations:
School of Computer Science, The Interdisciplinary Center, Herzliya, Israel;Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark
Venue:
Operations Research Letters
Year:
2002

Citing 13
Cited 13

Scheduling independent tasks on uniform processors

SIAM Journal on Computing
Tighter bounds for LPT scheduling on uniform processors

SIAM Journal on Computing
An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling

SIAM Journal on Computing
A lower bound for randomized on-line multiprocessor scheduling

Information Processing Letters
A Level Algorithm for Preemptive Scheduling

Journal of the ACM (JACM)
Preemptive multiprocessor scheduling with rejection

Theoretical Computer Science
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
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
An optimal algorithm for preemptive on-line scheduling

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

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data

Information and Computation
Preemptive semi-online scheduling with tightly-grouped processing times

Journal of Computer Science and Technology
Optimal preemptive semi-online scheduling on two uniform processors

Information Processing Letters
Optimal semi-online preemptive algorithms for machine covering on two uniform machines

Theoretical Computer Science
Semi-online scheduling on two uniform processors

Theoretical Computer Science
Optimal and online preemptive scheduling on uniformly related machines

Journal of Scheduling
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data

Information and Computation
Optimal preemptive semi-online scheduling on two uniform processors

Information Processing Letters
Semi-online preemptive scheduling: study of special cases

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Semi-online scheduling on two uniform machines with the known largest size

Journal of Combinatorial Optimization
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
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 study a preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines. We analyze the algorithms as a function of the speed ratio (q=1) between the two machines. We design algorithms of optimal competitive ratio for all values of q, and show that for q2, idle time needs to be introduced. This is the first preemptive scheduling problem over list, where idle time is provably required.