On-line scheduling on a single machine: maximizing the number of early jobs
On-line scheduling on a single machine: maximizing the number of early jobs
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.
combinatorial problems, on-line algorithms, competitive analysis, worst-case bounds, single-machine scheduling
193-197
Hoogeveen, Han
70e9b035-52a1-435b-8b27-e00e65092b5a
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Woeginger, Gerhard J.
4a4451b9-8520-4cf5-9d12-15a0e9a01eb0
2000
Hoogeveen, Han
70e9b035-52a1-435b-8b27-e00e65092b5a
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Woeginger, Gerhard J.
4a4451b9-8520-4cf5-9d12-15a0e9a01eb0
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), .
(doi:10.1016/S0167-6377(00)00061-4).
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 . Moreover, we show that there does not exist an on-line algorithm with a better performance guarantee.
This record has no associated files available for download.
More information
Published date: 2000
Keywords:
combinatorial problems, on-line algorithms, competitive analysis, worst-case bounds, single-machine scheduling
Organisations:
Operational Research
Identifiers
Local EPrints ID: 29610
URI: http://eprints.soton.ac.uk/id/eprint/29610
ISSN: 0167-6377
PURE UUID: 04697349-ef5a-42d5-a35f-3a75052b10b3
Catalogue record
Date deposited: 19 Jul 2006
Last modified: 15 Mar 2024 07:33
Export record
Altmetrics
Contributors
Author:
Han Hoogeveen
Author:
Gerhard J. Woeginger
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