Power of preemption for minimizing total completion time on uniform parallel machines

Leah Epstein; Asaf Levin; Alan J. Soper; Vitaly A. Strusevich

doi:10.1137/16M1066610

Power of preemption for minimizing total completion time on uniform parallel machines

Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich

Department of Mathematics

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

Abstract

For scheduling problems on parallel machines, the power of preemption is defined as the supremum ratio of the cost of an optimal nonpreemptive schedule over the cost of an optimal preemptive schedule (for the same input), where the cost is defined by a fixed common cost function. We present a tight analysis of the power of preemption for the problem of minimizing the total completion time on m ≥ 2 uniformly related machines, showing that its value for m = 2 is equal to 1.2, and its overall value is approximately 1.39795.

Original language	English
Pages (from-to)	101-123
Number of pages	23
Journal	SIAM Journal on Discrete Mathematics
Volume	31
Issue number	1
DOIs	https://doi.org/10.1137/16M1066610
State	Published - 2017

Bibliographical note

Publisher Copyright:
© 2017 SIAM. Published by SIAM under the terms.

Keywords

Power of preemption
Scheduling
Total completion time
Uniformly related machines

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1137/16M1066610

Cite this

@article{e7414e51041242d8aca749cc3d70e4e6,

title = "Power of preemption for minimizing total completion time on uniform parallel machines",

abstract = "For scheduling problems on parallel machines, the power of preemption is defined as the supremum ratio of the cost of an optimal nonpreemptive schedule over the cost of an optimal preemptive schedule (for the same input), where the cost is defined by a fixed common cost function. We present a tight analysis of the power of preemption for the problem of minimizing the total completion time on m ≥ 2 uniformly related machines, showing that its value for m = 2 is equal to 1.2, and its overall value is approximately 1.39795.",

keywords = "Power of preemption, Scheduling, Total completion time, Uniformly related machines",

author = "Leah Epstein and Asaf Levin and Soper, {Alan J.} and Strusevich, {Vitaly A.}",

note = "Publisher Copyright: {\textcopyright} 2017 SIAM. Published by SIAM under the terms.",

year = "2017",

doi = "10.1137/16M1066610",

language = "English",

volume = "31",

pages = "101--123",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "1",

}

TY - JOUR

T1 - Power of preemption for minimizing total completion time on uniform parallel machines

AU - Epstein, Leah

AU - Levin, Asaf

AU - Soper, Alan J.

AU - Strusevich, Vitaly A.

PY - 2017

Y1 - 2017

N2 - For scheduling problems on parallel machines, the power of preemption is defined as the supremum ratio of the cost of an optimal nonpreemptive schedule over the cost of an optimal preemptive schedule (for the same input), where the cost is defined by a fixed common cost function. We present a tight analysis of the power of preemption for the problem of minimizing the total completion time on m ≥ 2 uniformly related machines, showing that its value for m = 2 is equal to 1.2, and its overall value is approximately 1.39795.

AB - For scheduling problems on parallel machines, the power of preemption is defined as the supremum ratio of the cost of an optimal nonpreemptive schedule over the cost of an optimal preemptive schedule (for the same input), where the cost is defined by a fixed common cost function. We present a tight analysis of the power of preemption for the problem of minimizing the total completion time on m ≥ 2 uniformly related machines, showing that its value for m = 2 is equal to 1.2, and its overall value is approximately 1.39795.

KW - Power of preemption

KW - Scheduling

KW - Total completion time

KW - Uniformly related machines

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

U2 - 10.1137/16M1066610

DO - 10.1137/16M1066610

M3 - Article

AN - SCOPUS:85018680656

SN - 0895-4801

VL - 31

SP - 101

EP - 123

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 1

ER -

Power of preemption for minimizing total completion time on uniform parallel machines

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this