On-line scheduling on a single machine : maximizing the number of early jobs

J.A. Hoogeveen; C.N. Potts; G.J. Woeginger

doi:10.1016/S0167-6377(00)00061-4

On-line scheduling on a single machine : maximizing the number of early jobs

J.A. Hoogeveen, C.N. Potts, G.J. Woeginger

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

48 Citations (Scopus)

Abstract

This note deals with the scheduling problem of maximizing the number of early jobs on a single machine. We investigate the on-line version of this problem in the Preemption-Restart model. This means that jobs may be preempted, but preempting results in all the work done on this job so far being lost. Thus, if the job is restarted, then it has to be done from scratch. We prove that the shortest remaining processing time (SRPT) rule yields an on-line algorithm with competitive ratio 1/2. Moreover, we show that there does not exist an on-line algorithm with a better performance guarantee.

Original language	English
Pages (from-to)	193-197
Journal	Operations Research Letters
Volume	27
Issue number	5
DOIs	https://doi.org/10.1016/S0167-6377(00)00061-4
Publication status	Published - 2000

Access to Document

10.1016/S0167-6377(00)00061-4

Cite this

@article{587520d83ea047d0988cb9b4076cb1ec,

title = "On-line scheduling on a single machine : maximizing the number of early jobs",

abstract = "This note deals with the scheduling problem of maximizing the number of early jobs on a single machine. We investigate the on-line version of this problem in the Preemption-Restart model. This means that jobs may be preempted, but preempting results in all the work done on this job so far being lost. Thus, if the job is restarted, then it has to be done from scratch. We prove that the shortest remaining processing time (SRPT) rule yields an on-line algorithm with competitive ratio 1/2. Moreover, we show that there does not exist an on-line algorithm with a better performance guarantee.",

author = "J.A. Hoogeveen and C.N. Potts and G.J. Woeginger",

year = "2000",

doi = "10.1016/S0167-6377(00)00061-4",

language = "English",

volume = "27",

pages = "193--197",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - On-line scheduling on a single machine : maximizing the number of early jobs

AU - Hoogeveen, J.A.

AU - Potts, C.N.

AU - Woeginger, G.J.

PY - 2000

Y1 - 2000

N2 - This note deals with the scheduling problem of maximizing the number of early jobs on a single machine. We investigate the on-line version of this problem in the Preemption-Restart model. This means that jobs may be preempted, but preempting results in all the work done on this job so far being lost. Thus, if the job is restarted, then it has to be done from scratch. We prove that the shortest remaining processing time (SRPT) rule yields an on-line algorithm with competitive ratio 1/2. Moreover, we show that there does not exist an on-line algorithm with a better performance guarantee.

AB - This note deals with the scheduling problem of maximizing the number of early jobs on a single machine. We investigate the on-line version of this problem in the Preemption-Restart model. This means that jobs may be preempted, but preempting results in all the work done on this job so far being lost. Thus, if the job is restarted, then it has to be done from scratch. We prove that the shortest remaining processing time (SRPT) rule yields an on-line algorithm with competitive ratio 1/2. Moreover, we show that there does not exist an on-line algorithm with a better performance guarantee.

U2 - 10.1016/S0167-6377(00)00061-4

DO - 10.1016/S0167-6377(00)00061-4

M3 - Article

SN - 0167-6377

VL - 27

SP - 193

EP - 197

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

On-line scheduling on a single machine : maximizing the number of early jobs

Abstract

Access to Document

Fingerprint

Cite this