Scheduling search procedures

Scheduling search procedures

0.00 Avg rating0 Votes
Article ID: iaor2008187
Country: United Kingdom
Volume: 7
Issue: 5
Start Page Number: 349
End Page Number: 364
Publication Date: Sep 2004
Journal: Journal of Scheduling
Authors:
Keywords: biology, probability
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.