Online scheduling of unit jobs on three machines with rejection: A tight result

Leah Epstein; Hanan Zebedat-Haider

doi:10.1016/j.ipl.2015.11.012

Online scheduling of unit jobs on three machines with rejection: A tight result

Leah Epstein, Hanan Zebedat-Haider

Department of Mathematics

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

Abstract

We design an algorithm of the best possible competitive ratio for preemptive and non-preemptive scheduling of unit size jobs with rejection on three identical machines. The algorithm does not use preemption even for the preemptive variant, and it has the interesting feature that one of its parameters is not fixed in advance, and it is defined based on the properties of the first input job having a sufficiently large rejection penalty.

Original language	English
Pages (from-to)	252-255
Number of pages	4
Journal	Information Processing Letters
Volume	116
Issue number	3
DOIs	https://doi.org/10.1016/j.ipl.2015.11.012
State	Published - Mar 2016

Bibliographical note

Publisher Copyright:
© 2015 Elsevier B.V.

Keywords

Competitive ratio
On-line algorithms
Scheduling

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2015.11.012

Cite this

@article{314efe165a8c4d1bbf4518683ae06e24,

title = "Online scheduling of unit jobs on three machines with rejection: A tight result",

abstract = "We design an algorithm of the best possible competitive ratio for preemptive and non-preemptive scheduling of unit size jobs with rejection on three identical machines. The algorithm does not use preemption even for the preemptive variant, and it has the interesting feature that one of its parameters is not fixed in advance, and it is defined based on the properties of the first input job having a sufficiently large rejection penalty.",

keywords = "Competitive ratio, On-line algorithms, Scheduling",

author = "Leah Epstein and Hanan Zebedat-Haider",

note = "Publisher Copyright: {\textcopyright} 2015 Elsevier B.V.",

year = "2016",

month = mar,

doi = "10.1016/j.ipl.2015.11.012",

language = "English",

volume = "116",

pages = "252--255",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Online scheduling of unit jobs on three machines with rejection

T2 - A tight result

AU - Epstein, Leah

AU - Zebedat-Haider, Hanan

PY - 2016/3

Y1 - 2016/3

N2 - We design an algorithm of the best possible competitive ratio for preemptive and non-preemptive scheduling of unit size jobs with rejection on three identical machines. The algorithm does not use preemption even for the preemptive variant, and it has the interesting feature that one of its parameters is not fixed in advance, and it is defined based on the properties of the first input job having a sufficiently large rejection penalty.

AB - We design an algorithm of the best possible competitive ratio for preemptive and non-preemptive scheduling of unit size jobs with rejection on three identical machines. The algorithm does not use preemption even for the preemptive variant, and it has the interesting feature that one of its parameters is not fixed in advance, and it is defined based on the properties of the first input job having a sufficiently large rejection penalty.

KW - Competitive ratio

KW - On-line algorithms

KW - Scheduling

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

U2 - 10.1016/j.ipl.2015.11.012

DO - 10.1016/j.ipl.2015.11.012

M3 - Article

AN - SCOPUS:84950118540

SN - 0020-0190

VL - 116

SP - 252

EP - 255

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Online scheduling of unit jobs on three machines with rejection: A tight result

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this