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

Leah Epstein

doi:10.1016/S0167-6377(01)00085-2

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

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

Abstract

We study preemptive scheduling on uniformly related processors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non-decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.

Original language	English
Pages (from-to)	93-98
Number of pages	6
Journal	Operations Research Letters
Volume	29
Issue number	2
DOIs	https://doi.org/10.1016/S0167-6377(01)00085-2
State	Published - Sep 2001
Externally published	Yes

Keywords

Algorithms
Scheduling

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/S0167-6377(01)00085-2

Cite this

@article{a05735676e4645409cba9619d7ea5633,

title = "Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios",

abstract = "We study preemptive scheduling on uniformly related processors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non-decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.",

keywords = "Algorithms, Scheduling",

author = "Leah Epstein",

year = "2001",

month = sep,

doi = "10.1016/S0167-6377(01)00085-2",

language = "English",

volume = "29",

pages = "93--98",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios

AU - Epstein, Leah

PY - 2001/9

Y1 - 2001/9

N2 - We study preemptive scheduling on uniformly related processors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non-decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.

AB - We study preemptive scheduling on uniformly related processors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non-decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.

KW - Algorithms

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=0035451169&partnerID=8YFLogxK

U2 - 10.1016/S0167-6377(01)00085-2

DO - 10.1016/S0167-6377(01)00085-2

M3 - Article

AN - SCOPUS:0035451169

SN - 0167-6377

VL - 29

SP - 93

EP - 98

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this