On-line scheduling of unit time jobs with rejection: Minimizing the total completion time

Leah Epstein; John Noga; Gerhard Woeginger

doi:10.1016/S0167-6377(02)00160-8

On-line scheduling of unit time jobs with rejection: Minimizing the total completion time

Leah Epstein, John Noga, Gerhard Woeginger

Discrete Mathematics and Mathematical Programming

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

56 Citations (Scopus)

Abstract

We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, or be rejected at the cost of a penalty. The objective is to minimize the total completion time of the accepted jobs plus the sum of the penalties of the rejected jobs. We give an on-line algorithm for this problem with competitive ratio . Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784.

Original language	English
Pages (from-to)	415-420
Journal	Operations research letters
Volume	30
Issue number	6
DOIs	https://doi.org/10.1016/S0167-6377(02)00160-8
Publication status	Published - 2002

Keywords

IR-74863
On-line algorithm
Scheduling
Worst-case bounds
METIS-208618
Competitive Analysis

Access to Document

10.1016/S0167-6377(02)00160-8

Cite this

@article{c9c9ea8e8c494c988564888810abbed9,

title = "On-line scheduling of unit time jobs with rejection: Minimizing the total completion time",

abstract = "We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, or be rejected at the cost of a penalty. The objective is to minimize the total completion time of the accepted jobs plus the sum of the penalties of the rejected jobs. We give an on-line algorithm for this problem with competitive ratio . Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784.",

keywords = "IR-74863, On-line algorithm, Scheduling, Worst-case bounds, METIS-208618, Competitive Analysis",

author = "Leah Epstein and John Noga and Gerhard Woeginger",

year = "2002",

doi = "10.1016/S0167-6377(02)00160-8",

language = "English",

volume = "30",

pages = "415--420",

journal = "Operations research letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - On-line scheduling of unit time jobs with rejection: Minimizing the total completion time

AU - Epstein, Leah

AU - Noga, John

AU - Woeginger, Gerhard

PY - 2002

Y1 - 2002

N2 - We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, or be rejected at the cost of a penalty. The objective is to minimize the total completion time of the accepted jobs plus the sum of the penalties of the rejected jobs. We give an on-line algorithm for this problem with competitive ratio . Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784.

AB - We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, or be rejected at the cost of a penalty. The objective is to minimize the total completion time of the accepted jobs plus the sum of the penalties of the rejected jobs. We give an on-line algorithm for this problem with competitive ratio . Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784.

KW - IR-74863

KW - On-line algorithm

KW - Scheduling

KW - Worst-case bounds

KW - METIS-208618

KW - Competitive Analysis

U2 - 10.1016/S0167-6377(02)00160-8

DO - 10.1016/S0167-6377(02)00160-8

M3 - Article

VL - 30

SP - 415

EP - 420

JO - Operations research letters

JF - Operations research letters

SN - 0167-6377

IS - 6

ER -

On-line scheduling of unit time jobs with rejection: Minimizing the total completion time

Abstract

Keywords

Access to Document

Fingerprint

Cite this