Lower bound for on-line scheduling on uniformly related machines

Leah Epstein; Jiří Sgall

doi:10.1016/S0167-6377(99)00062-0

Lower bound for on-line scheduling on uniformly related machines

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

Abstract

We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.

Original language	English
Article number	1281
Pages (from-to)	17-22
Number of pages	6
Journal	Operations Research Letters
Volume	26
Issue number	1
DOIs	https://doi.org/10.1016/S0167-6377(99)00062-0
State	Published - 2000
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.1016/S0167-6377(99)00062-0

Cite this

@article{5f0c1de8223d476a8550b6318c7ba354,

title = "Lower bound for on-line scheduling on uniformly related machines",

abstract = "We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.",

author = "Leah Epstein and Ji{\v r}{\'i} Sgall",

year = "2000",

doi = "10.1016/S0167-6377(99)00062-0",

language = "English",

volume = "26",

pages = "17--22",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Lower bound for on-line scheduling on uniformly related machines

AU - Epstein, Leah

AU - Sgall, Jiří

PY - 2000

Y1 - 2000

N2 - We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.

AB - We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.

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

U2 - 10.1016/S0167-6377(99)00062-0

DO - 10.1016/S0167-6377(99)00062-0

M3 - Article

AN - SCOPUS:0034135264

SN - 0167-6377

VL - 26

SP - 17

EP - 22

JO - Operations Research Letters

JF - Operations Research Letters

IS - 1

M1 - 1281

ER -

Lower bound for on-line scheduling on uniformly related machines

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this