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

Authors:
Young He;Yiwei Jiang
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou, PR China and State Key Lab of CAD & CG, Zhejiang University, Hangzhou, PR China;Department of Mathematics, Zhejiang University, Hangzhou, PR China and State Key Lab of CAD & CG, Zhejiang University, Hangzhou, PR China
Venue:
Theoretical Computer Science
Year:
2005

Citing 16
Cited 3

A lower bound for randomized on-line multiprocessor scheduling

Information Processing Letters
Semi on-line scheduling on two identical machines

Computing
A Level Algorithm for Preemptive Scheduling

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
On-line bin-stretching

Theoretical Computer Science
Approximation Schemes for Covering and Scheduling on Related Machines

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
On-Line Machine Covering

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Semi on-line algorithms for the partition problem

Operations Research Letters
A polynomial-time approximation scheme for maximizing the minimum machine completion time

Operations Research Letters
Ordinal algorithms for parallel machine scheduling

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
Semi-on-line scheduling with ordinal data on two uniform machines

Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information

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

Operations Research Letters

Approximation schemes for scheduling and covering on unrelated machines

Theoretical Computer Science
Semi-online machine covering for two uniform machines

Theoretical Computer Science
Preemptive semi-online scheduling on parallel machines with inexact partial information

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we consider the semi-online preemptive scheduling problem with decreasing job sizes on two uniform machines. Our goal is to maximize the continuous period of time (starting from time zero) when both machines are busy, which is equivalent to maximizing the minimum machine completion time if idle time is not introduced before all the jobs are completed. We design optimal deterministic semi-online algorithms for every machine speed ratio s ∈ [1, ∞), and show that idle time is required during the assignment procedure of algorithms for any s √6/2. The competitive ratios of the algorithms match the randomized lower bound for every 1 ≤ s ≤ 3. The problem of whether randomization still does not help for the discussed preemptive scheduling problem remains open.