Skip to main content
SpringerLink
Log in

Scheduling Search Procedures

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  • Baeza-Yates, R., J. Culberson, and G. Rawlins, "Searching in the plane," Information and Computation, 106, 234–252 (1993).

    Google Scholar 

  • Bansal, N., K. Dhandhere, J. Könemann, and A. Sinha, "Non-clairvoyant scheduling for minimizing mean slowdown," in 20th STACS'2003, vol. 2607, Lecture Notes in Computer Science, pp. 260–270.

  • Becchetti, L. and S. Leonardi, "Non-clairvoyant scheduling to minimize average flowtime on single and parallel machines," in 33rd ACM STOC'2001, pp. 94–103.

  • Becchetti, L., S. Leonardi, A. Marchetti-Spaccamela, and K. R. Pruhs, "Online weighted flow time and deadline scheduling," in APPROX-RANDOM'2001, vol. 2129, Lecture Notes in Computer Science, pp. 36–47.

  • Borodin, A. and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press, 1998.

  • Chrobak, M., L. Epstein, J. Noga, J. Sgall, R. van Stee, T. Tichy, and N. Vakhania, "Preemptive scheduling in overloaded systems," in 29th ICALP'2002, vol. 2380 Lecture Notes in Computer Science, pp. 800–811.

  • Ejeskär, K., "Genetic alterations in Scandinavian neuroblastoma tumors," PhD thesis, Gothenburg University, 2000.

  • Koutsoupias, E. and C. Papadimitriou, "Beyond competitive analysis." SIAM Journal on Computing, 30, 300–317 (2000).

    Google Scholar 

  • Liberatore, V., "Scheduling jobs before shut-down," Nordic Journal of Computing, 7(3), 204–226 (2000).

    Google Scholar 

  • Lopez-Ortiz, A. and S. Schuierer, "Online parallel heuristics and robot searching under the competitive framework," in 8th SWAT'2002, vol. 2368, Lecture Notes in Computer Science, 2002, pp. 260–269.

    Google Scholar 

  • Möhring, R. H., "Scheduling under uncertainty: Optimizing against a randomizing adversary,"TechnicalReport 681-2000, Dept. of Mathematics, TU Berlin

  • Motwani, R., S. Phillips, and E. Torng, "Nonclairvoyant scheduling," Theoretical Computer Science, 130, 17–47 (1994).

    Google Scholar 

  • Sgall, J., "On-line scheduling-a survey," vol. 1442, Lecture Notes in Computer Science, 1997, pp. 196–231.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Chalmers University, 41296, Göteborg, Sweden

    Peter Damaschke

Authors
  1. Peter Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Damaschke, P. Scheduling Search Procedures. Journal of Scheduling 7, 349–364 (2004). https://doi.org/10.1023/B:JOSH.0000036859.97424.e5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOSH.0000036859.97424.e5

Search

Navigation