Scheduling Search Procedures

Authors:
Peter Damaschke
Affiliations:
-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 6
Cited 0

Searching in the plane

Information and Computation
Nonclairvoyant scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Online computation and competitive analysis

Online computation and competitive analysis
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Beyond Competitive Analysis

SIAM Journal on Computing
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze preemptive on-line scheduling against randomized adversaries, where the goal is only to finish an unknown distinguishedtarget job. The problem is motivatedb y a clinical gene search project, but it leads to theoretical questions of broader interest, including some natural but unusual probabilistic models. For some versions of our problem we get optimal competitive ratios, expressedb y given parameters of instances.