Preemptive on-line scheduling for two uniform processors

Authors:
Jianjun Wen;Donglei Du
Affiliations:
Institute of Applied Mathematics, Chinese Academy of Sciences, P.O. Box 2734, Beijing 100080, People's Republic of China;Institute of Applied Mathematics, Chinese Academy of Sciences, P.O. Box 2734, Beijing 100080, People's Republic of China
Venue:
Operations Research Letters
Year:
1998

Citing 3
Cited 18

Amortized efficiency of list update and paging rules

Communications of the ACM
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
An optimal algorithm for preemptive on-line scheduling

Operations Research Letters

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
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
Preemptive online scheduling: optimal algorithms for all speeds

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Semi-online scheduling on two uniform processors

Theoretical Computer Science
Preemptive scheduling on a small number of hierarchical machines

Information and Computation
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the lpNorm

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Online scheduling on two uniform machines to minimize the makespan

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

Journal of Scheduling
Optimal preemptive semi-online scheduling on two uniform processors

Information Processing Letters
Semi-online scheduling on two uniform machines with the known largest size

Journal of Combinatorial Optimization
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
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios

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

Operations Research Letters
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the processors has speed 1 and the other has speed s=1. The objective is to minimize the makespan. A best possible algorithm with competitive ratio of (1+s)^2/(1+s+s^2) is proposed for this problem.