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).

Download

Full text not available from this repository.

Original Publication URL: http://dx.doi.org/10.1287/moor.1040.0092

Description/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
ISSNs: 0364-765X (print)
Related URLs:
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
Divisions: University Structure - Pre August 2011 > School of Mathematics > Operational Research
ePrint ID: 29627
Date Deposited: 11 May 2006
Last Modified: 27 Mar 2014 18:18
URI: http://eprints.soton.ac.uk/id/eprint/29627

Actions (login required)

View Item View Item