Maximizing job completions online

Authors:
Bala Kalyanasundaram;Kirk R. Pruhs
Affiliations:
Department of Computer Science, Georgetown University, Washington, DC;Department of Computer Science, University of Pittsburgh, Pittsburgh, PA
Venue:
Journal of Algorithms
Year:
2003

Citing 11
Cited 5

On the competitiveness of on-line real-time task scheduling

Real-Time Systems
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling

Theoretical Computer Science - Special issue on dependable parallel computing
On-line scheduling of jobs with fixed start and end times

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Randomized on-line scheduling of parallel jobs

Journal of Algorithms
Online computation

Approximation algorithms for NP-hard problems
Online computation and competitive analysis

Online computation and competitive analysis
Online interval scheduling

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Scheduling Algorithms

Scheduling Algorithms
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms

Journal of Scheduling - Special issue: On-line algorithm part I

How to whack moles

Theoretical Computer Science - Approximation and online algorithms
Minimizing the maximum starting time on-line

Information and Computation
Online scheduling of bounded length jobs to maximize throughput

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online scheduling of bounded length jobs to maximize throughput

Journal of Scheduling
Online traveling salesman problem with deadline and advanced information

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of maximizing the number of jobs completed by their deadline in an online single processor system where the jobs are preemptable and have release times. So in the standard three field scheduling notation, this is the online version of the problem 1 |ri; pmtn| Σ(1 - Ui). We present a deterministic algorithm Lax, and show that for every instance I, it is the case that either Lax, or the well-known deterministic algorithm SRPT (Shortest Remaining Processing Time), is constant competitive on I. An immediate consequence of this result is a constant competitive randomized algorithm for this problem. It is known that no constant competitive deterministic algorithm exists for this problem.