Skip to main content
SpringerLink
Log in

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We study online scheduling on m uniform machines, where m−1 of them have a reference speed 1 and the last one a speed s with 0≤s≤1. The competitive ratio of the well-known List Scheduling (LS) algorithm is determined. For some values of s and m=3, LS is proven to be the best deterministic algorithm. We describe a randomized heuristic for m machines. Finally, for the case m=3, we develop and analyze the competitive ratio of a randomized algorithm which outperforms LS for any s.

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.

Institutional subscriptions

Similar content being viewed by others

References

  • Bartal, Y., Fiat, A., Karloff, H., & Vohra, R. (1995). New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences, 51(3), 359–366.

    Article  Google Scholar 

  • Borodin, A., Irani, S., Raghavan, P., & Schieber, B. (1995). Competitive paging with locality of reference. Journal of Computer and System Sciences, 50(2), 244–258.

    Article  Google Scholar 

  • Cheng, T. C. E., Ng, C. T., & Kotov, V. (2006). A new algorithm for online uniform-machine scheduling to minimize the makespan. Information Processing Letters, 99(3), 102–105.

    Article  Google Scholar 

  • Cho, Y., & Sahni, S. (1980). Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1), 91–103.

    Article  Google Scholar 

  • Epstein, L., Noga, J., Seiden, S., Sgall, J., & Woeginger, G. (2001). Randomized on-line scheduling on two uniform machines. Journal of Scheduling, 4(2), 71–92.

    Article  Google Scholar 

  • Hochbaum, D. S. (1997). Approximation algorithms for NP-hard problems. Boston: PWS Publishing Company.

    Google Scholar 

  • Kokash, N. (2004). An efficient heuristic for on-line scheduling in system with one fast machine. Master Thesis.

  • Li, R., & Shi, L. (1998). An on-line algorithm for some uniform processor scheduling. SIAM Journal on Computing, 27(2), 414–422.

    Article  Google Scholar 

  • Seiden, S. S. (2000). Randomized online multiprocessor scheduling. Algorithmica, 28(2), 173–216.

    Article  Google Scholar 

  • Sgall, J. (1994). On-line scheduling on parallel machines. Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, PA.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica pura ed applicata, Università degli Studi di Padova, Via Trieste 63, 35121, Padova, Italy

    Antoine Musitelli

  2. ROSO/IMA, EPFL, Lausanne, 1015, Switzerland

    Jean-Marc Nicoletti

Authors
  1. Antoine Musitelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Marc Nicoletti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Marc Nicoletti.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Musitelli, A., Nicoletti, JM. Competitive ratio of List Scheduling on uniform machines and randomized heuristics. J Sched 14, 89–101 (2011). https://doi.org/10.1007/s10951-010-0177-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-010-0177-x

Keywords

Search

Navigation