Scheduling Search Procedures

We analyze preemptive on-line scheduling against randomized adversaries, with the goal to finish an unknown distinguished target job. Our motivation comes from clinical gene search projects, but the subject leads to general theoretical questions of independent interest, including some natural but un...

Full description

Saved in:
Bibliographic Details
Published inJournal of scheduling Vol. 7; no. 5; pp. 349 - 364
Main Author Damaschke, Peter
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.09.2004
Subjects
Bayesian models
Candidates
Chromosomes
Comparative analysis
Computer science
Employment
Genes
Hypotheses
Motivation
Mutation
on-line algorithms
Parameter estimation
randomized adversary
Scheduling
searching
Online AccessGet full text
ISSN1094-6136
1099-1425
1099-1425
DOI10.1023/B:JOSH.0000036859.97424.e5

Cover

More Information
Summary:We analyze preemptive on-line scheduling against randomized adversaries, with the goal to finish an unknown distinguished target job. Our motivation comes from clinical gene search projects, but the subject leads to general theoretical questions of independent interest, including some natural but unusual probabilistic models. We study problem versions with known and unknown processing times of jobs and target probabilities, and models where the on-line player gets some randomized extra information about the target. For some versions we get optimal competitive ratios, expressed in terms of given parameters of instances.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1094-6136
1099-1425
1099-1425
DOI:10.1023/B:JOSH.0000036859.97424.e5