Please use this identifier to cite or link to this item:
Title: Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
Authors: Chin, F. Y. L.
Fung, S. P. Y.
First Published: 2003
Citation: Algorithmica, 2003, 37 (3), pp.149-164
Abstract: We study the following online preemptive scheduling problem: given a set of jobs with release times, deadlines, processing times and weights, schedule them so as to maximize the total value obtained. Unlike traditional scheduling problems, partially completed jobs can get partial values proportional to their amounts processed. Recently Chrobak et al. gave improved lower and upper bounds [1.236, 1.8] on the competitive ratio for this problem, the upper bound being achieved by using timesharing to simulate two equal-speed processors. In this paper we (1) give a new algorithm MIXED-k with competitive ratio 1/(1 − (k/(k + 1))k ) which approaches e/(e−1) ≈ 1.582 when k → ∞, by using timesharing to simulate k equal-speed processors; (2) give an equivalent but much more practical algorithm MIX, which is e/(e − 1)-competitive (independent of k), by timesharing the processor with different speeds (depending on the job weights), and use its interesting properties to devise an efficient implementation; (3) improve the lower bound to 1.25 by showing an identical lower bound for randomized algorithms; and (4) prove a lower bound of 1.618 on the competitive ratio when timesharing is not allowed, thus answering an open problem raised by Chang and Yap, showing that timesharing provably helps in giving better algorithms for this problem.
DOI Link: 10.1007/s00453-003-1025-6
ISSN: 0178-4617
Type: Article
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.