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

Leah Epstein; John Noga; Gerhard J. 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 J. Woeginger

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

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 1/2(2 + 3) ≈ 1.86602. 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
Number of pages	6
Journal	Operations Research Letters
Volume	30
Issue number	6
DOIs	https://doi.org/10.1016/S0167-6377(02)00160-8
State	Published - Dec 2002
Externally published	Yes

Keywords

Competitive analysis
On-line algorithm
Scheduling
Worst-case bounds

ASJC Scopus subject areas

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

Access to Document

10.1016/S0167-6377(02)00160-8

Cite this

@article{56b10a7a58904b49a05ed10224f9bdda,

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 1/2(2 + 3) ≈ 1.86602. Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784.",

keywords = "Competitive analysis, On-line algorithm, Scheduling, Worst-case bounds",

author = "Leah Epstein and John Noga and Woeginger, \{Gerhard J.\}",

year = "2002",

month = dec,

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

T2 - Minimizing the total completion time

AU - Epstein, Leah

AU - Noga, John

AU - Woeginger, Gerhard J.

PY - 2002/12

Y1 - 2002/12

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 1/2(2 + 3) ≈ 1.86602. 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 1/2(2 + 3) ≈ 1.86602. Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784.

KW - Competitive analysis

KW - On-line algorithm

KW - Scheduling

KW - Worst-case bounds

UR - https://www.scopus.com/pages/publications/0036887947

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

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

M3 - Article

AN - SCOPUS:0036887947

SN - 0167-6377

VL - 30

SP - 415

EP - 420

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this