Computer Science – Data Structures and Algorithms
Scientific paper
2010-08-28
Computer Science
Data Structures and Algorithms
Conference version in FOCS 2010
Scientific paper
We consider the following general scheduling problem: The input consists of n jobs, each with an arbitrary release time, size, and a monotone function specifying the cost incurred when the job is completed at a particular time. The objective is to find a preemptive schedule of minimum aggregate cost. This problem formulation is general enough to include many natural scheduling objectives, such as weighted flow, weighted tardiness, and sum of flow squared. Our main result is a randomized polynomial-time algorithm with an approximation ratio O(log log nP), where P is the maximum job size. We also give an O(1) approximation in the special case when all jobs have identical release times. The main idea is to reduce this scheduling problem to a particular geometric set-cover problem which is then solved using the local ratio technique and Varadarajan's quasi-uniform sampling technique. This general algorithmic approach improves the best known approximation ratios by at least an exponential factor (and much more in some cases) for essentially all of the nontrivial common special cases of this problem. Our geometric interpretation of scheduling may be of independent interest.
Bansal Nikhil
Pruhs Kirk
No associations
LandOfFree
The Geometry of Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Geometry of Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Geometry of Scheduling will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-312239