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

Leah Epstein; Lene M. Favrholdt

doi:10.1016/S0167-6377(02)00179-7

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

Leah Epstein, Lene M. Favrholdt

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

Abstract

We study a preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines. We analyze the algorithms as a function of the speed ratio (q ≥ 1) between the two machines. We design algorithms of optimal competitive ratio for all values of q, and show that for q > 2, idle time needs to be introduced. This is the first preemptive scheduling problem over list, where idle time is provably required.

Original language	English
Pages (from-to)	269-275
Number of pages	7
Journal	Operations Research Letters
Volume	30
Issue number	4
DOIs	https://doi.org/10.1016/S0167-6377(02)00179-7
State	Published - Aug 2002
Externally published	Yes

Keywords

Scheduling
Semi-online

ASJC Scopus subject areas

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

Access to Document

10.1016/S0167-6377(02)00179-7

Cite this

@article{63854b065d7245229717abce1b4a4595,

title = "Optimal preemptive semi-online scheduling to minimize makespan on two related machines",

abstract = "We study a preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines. We analyze the algorithms as a function of the speed ratio (q ≥ 1) between the two machines. We design algorithms of optimal competitive ratio for all values of q, and show that for q > 2, idle time needs to be introduced. This is the first preemptive scheduling problem over list, where idle time is provably required.",

keywords = "Scheduling, Semi-online",

author = "Leah Epstein and Favrholdt, {Lene M.}",

year = "2002",

month = aug,

doi = "10.1016/S0167-6377(02)00179-7",

language = "English",

volume = "30",

pages = "269--275",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Optimal preemptive semi-online scheduling to minimize makespan on two related machines

AU - Epstein, Leah

AU - Favrholdt, Lene M.

PY - 2002/8

Y1 - 2002/8

N2 - We study a preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines. We analyze the algorithms as a function of the speed ratio (q ≥ 1) between the two machines. We design algorithms of optimal competitive ratio for all values of q, and show that for q > 2, idle time needs to be introduced. This is the first preemptive scheduling problem over list, where idle time is provably required.

AB - We study a preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines. We analyze the algorithms as a function of the speed ratio (q ≥ 1) between the two machines. We design algorithms of optimal competitive ratio for all values of q, and show that for q > 2, idle time needs to be introduced. This is the first preemptive scheduling problem over list, where idle time is provably required.

KW - Scheduling

KW - Semi-online

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

U2 - 10.1016/S0167-6377(02)00179-7

DO - 10.1016/S0167-6377(02)00179-7

M3 - Article

AN - SCOPUS:0036699920

SN - 0167-6377

VL - 30

SP - 269

EP - 275

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this