The University of Southampton
University of Southampton Institutional Repository

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

Hoogeveen, Han, Potts, Chris N. and Woeginger, Gerhard J. (2000) On-line scheduling on a single machine: maximizing the number of early jobs Operations Research Letters, 27, (5), pp. 193-197. (doi:10.1016/S0167-6377(00)00061-4).

Record type: Article


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 . Moreover, we show that there does not exist an on-line algorithm with a better performance guarantee.

Full text not available from this repository.

More information

Published date: 2000
Keywords: combinatorial problems, on-line algorithms, competitive analysis, worst-case bounds, single-machine scheduling
Organisations: Operational Research


Local EPrints ID: 29610
ISSN: 0167-6377
PURE UUID: 04697349-ef5a-42d5-a35f-3a75052b10b3

Catalogue record

Date deposited: 19 Jul 2006
Last modified: 17 Jul 2017 15:57

Export record



Author: Han Hoogeveen
Author: Chris N. Potts
Author: Gerhard J. Woeginger

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.