Online scheduling of a single machine to minimize total weighted completion time
Online scheduling of a single machine to minimize total weighted completion time
This paper considers the online scheduling of a single machine in which jobs arrive over time, and preemption is not allowed. The goal is to minimize the total weighted completion time. We show that a simple modification of the shortest weighted processing time rule has a competitive ratio of two. This result is established using a new proof technique that does not rely explicitly on a lower bound on the optimal objective function value. Because it is known that no online algorithm can have a competitive ratio of less than two, we have resolved the open issue of determining the minimum competitive ratio for this problem.
scheduling, single machine, total weighted completion time, online algorithm, competitive ratio
686-697
Anderson, Edward J.
1279b761-3da8-431f-93be-9f2370e354d9
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
2004
Anderson, Edward J.
1279b761-3da8-431f-93be-9f2370e354d9
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Anderson, Edward J. and Potts, Chris N.
(2004)
Online scheduling of a single machine to minimize total weighted completion time.
Mathematics of Operations Research, 29 (3), .
(doi:10.1287/moor.1040.0092).
Abstract
This paper considers the online scheduling of a single machine in which jobs arrive over time, and preemption is not allowed. The goal is to minimize the total weighted completion time. We show that a simple modification of the shortest weighted processing time rule has a competitive ratio of two. This result is established using a new proof technique that does not rely explicitly on a lower bound on the optimal objective function value. Because it is known that no online algorithm can have a competitive ratio of less than two, we have resolved the open issue of determining the minimum competitive ratio for this problem.
This record has no associated files available for download.
More information
Published date: 2004
Keywords:
scheduling, single machine, total weighted completion time, online algorithm, competitive ratio
Organisations:
Operational Research
Identifiers
Local EPrints ID: 29627
URI: http://eprints.soton.ac.uk/id/eprint/29627
ISSN: 0364-765X
PURE UUID: 204118f5-2087-40ee-8969-75c53b622838
Catalogue record
Date deposited: 11 May 2006
Last modified: 15 Mar 2024 07:33
Export record
Altmetrics
Contributors
Author:
Edward J. Anderson
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