e-Prints Soton - Online scheduling of a single machine to minimize total weighted completion time

Online scheduling of a single machine to minimize total weighted completion time

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), 686-697. (doi:10.1287/moor.1040.0092)
http://eprints.soton.ac.uk/29627/

Full text of this item is not available from this server.

Official URL: http://dx.doi.org/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.

Item Type:	Article
ISSN:	0364-765X
Uncontrolled Keywords:	scheduling, single machine, total weighted completion time, online algorithm, competitive ratio
Subjects:	T Technology > TJ Mechanical engineering and machinery Q Science > QA Mathematics > QA75 Electronic computers. Computer science
School or Centre:	School of Mathematics > Operational Research
ID Code:	29627
Deposited By:	SOMM, Import
Deposited On:	11 May 2006

Edit this item (Staff only)

©2003-2006 University of Southampton
Related Sites: University of Southampton, Library, TARDis Project, GNU EPrints Software.