The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

Leah Epstein; Asaf Levin

doi:10.1016/j.orl.2016.09.013

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

Leah Epstein, Asaf Levin

Department of Mathematics

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

Abstract

We study the preemptive and non-preemptive problems of scheduling weighted jobs on a single machine so as to minimize the total weighted completion time. We analyze the relation between non-preemptive and preemptive schedules for the problem, and find the worst-case ratio between their costs, also called the benefit of preemption. We show that this value is equal to ee−1≈1.581.

Original language	English
Pages (from-to)	772-774
Number of pages	3
Journal	Operations Research Letters
Volume	44
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2016.09.013
State	Published - 1 Nov 2016

Bibliographical note

Publisher Copyright:
© 2016 Elsevier B.V.

Keywords

Power of preemption
Preemptive schedule
Release dates
Scheduling

ASJC Scopus subject areas

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

Access to Document

10.1016/j.orl.2016.09.013

Cite this

@article{d082c829ca204403b81e82b475217403,

title = "The benefit of preemption for single machine scheduling so as to minimize total weighted completion time",

abstract = "We study the preemptive and non-preemptive problems of scheduling weighted jobs on a single machine so as to minimize the total weighted completion time. We analyze the relation between non-preemptive and preemptive schedules for the problem, and find the worst-case ratio between their costs, also called the benefit of preemption. We show that this value is equal to ee−1≈1.581.",

keywords = "Power of preemption, Preemptive schedule, Release dates, Scheduling",

author = "Leah Epstein and Asaf Levin",

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

year = "2016",

month = nov,

day = "1",

doi = "10.1016/j.orl.2016.09.013",

language = "English",

volume = "44",

pages = "772--774",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

AU - Epstein, Leah

AU - Levin, Asaf

PY - 2016/11/1

Y1 - 2016/11/1

N2 - We study the preemptive and non-preemptive problems of scheduling weighted jobs on a single machine so as to minimize the total weighted completion time. We analyze the relation between non-preemptive and preemptive schedules for the problem, and find the worst-case ratio between their costs, also called the benefit of preemption. We show that this value is equal to ee−1≈1.581.

AB - We study the preemptive and non-preemptive problems of scheduling weighted jobs on a single machine so as to minimize the total weighted completion time. We analyze the relation between non-preemptive and preemptive schedules for the problem, and find the worst-case ratio between their costs, also called the benefit of preemption. We show that this value is equal to ee−1≈1.581.

KW - Power of preemption

KW - Preemptive schedule

KW - Release dates

KW - Scheduling

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

U2 - 10.1016/j.orl.2016.09.013

DO - 10.1016/j.orl.2016.09.013

M3 - Article

AN - SCOPUS:84992381895

SN - 0167-6377

VL - 44

SP - 772

EP - 774

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this