Optimal on-line algorithms to minimize makespan on two machines with resource augmentation

Leah Epstein; Arik Ganot

doi:10.1007/s00224-007-9007-8

Optimal on-line algorithms to minimize makespan on two machines with resource augmentation

Leah Epstein
, Arik Ganot

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling. For all these cases we design algorithms with best possible competitive ratios as functions of the machine speeds.

Original language	English
Pages (from-to)	431-449
Number of pages	19
Journal	Theory of Computing Systems
Volume	42
Issue number	4
DOIs	https://doi.org/10.1007/s00224-007-9007-8
State	Published - May 2008

Keywords

Load balancing
Online algorithms
Resource augmentation
Scheduling

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1007/s00224-007-9007-8

Cite this

@article{a6145d6cb52c416cb0e8eec7d05009a4,

title = "Optimal on-line algorithms to minimize makespan on two machines with resource augmentation",

abstract = "We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling. For all these cases we design algorithms with best possible competitive ratios as functions of the machine speeds.",

keywords = "Load balancing, Online algorithms, Resource augmentation, Scheduling",

author = "Leah Epstein and Arik Ganot",

year = "2008",

month = may,

doi = "10.1007/s00224-007-9007-8",

language = "English",

volume = "42",

pages = "431--449",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "4",

}

TY - JOUR

T1 - Optimal on-line algorithms to minimize makespan on two machines with resource augmentation

AU - Epstein, Leah

AU - Ganot, Arik

PY - 2008/5

Y1 - 2008/5

N2 - We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling. For all these cases we design algorithms with best possible competitive ratios as functions of the machine speeds.

AB - We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling. For all these cases we design algorithms with best possible competitive ratios as functions of the machine speeds.

KW - Load balancing

KW - Online algorithms

KW - Resource augmentation

KW - Scheduling

UR - https://www.scopus.com/pages/publications/40849092704

U2 - 10.1007/s00224-007-9007-8

DO - 10.1007/s00224-007-9007-8

M3 - Article

AN - SCOPUS:40849092704

SN - 1432-4350

VL - 42

SP - 431

EP - 449

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 4

ER -

Optimal on-line algorithms to minimize makespan on two machines with resource augmentation

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this