Skip to main content
Springer Nature Link
Log in

A Note on Semi-online Machine Covering

  • Conference paper
Approximation and Online Algorithms (WAOA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3879))

Included in the following conference series:

Abstract

In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm is given in advance the optimal value of the smallest load for the given instance, and then the jobs are scheduled one by one as they arrive, without any knowledge of the following jobs. We present a deterministic algorithm with competitive ratio 11/6≤ 1.834 for machine covering with any number of machines and a lower bound showing that no deterministic algorithm can have a competitive ratio below 43/24≥ 1.791.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1, 55–66 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Azar, Y., Epstein, L.: Approximation schemes for covering and scheduling on related machines. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 39–47. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Azar, Y., Epstein, L.: Online machine covering. J. Sched. 1, 67–77 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39, 43–57 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Friesen, D., Deuermeyer, B.: Analysis of greedy solutions for a replacement part sequencing problem. Math. Oper. Res. 6, 74–87 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  6. Woeginger, G.J.: A polynomial time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett. 20, 149–154 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, CZ-11567, Praha 1, Czech Republic

    Tomáš Ebenlendr & Jiří Sgall

  2. Department of Computer Science, California State University, Northridge, CA, 91330, USA

    John Noga

  3. Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Gerhard Woeginger

Authors
  1. Tomáš Ebenlendr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Noga
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiří Sgall
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gerhard Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

  2. Via Dipartimento di IInformatica ed Applicazioni, Universit{‘a degli Studi di Salerno, Via S. Allende 2, 84081, Baronissi, (SA), Italy

    Giuseppe Persinao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ebenlendr, T., Noga, J., Sgall, J., Woeginger, G. (2006). A Note on Semi-online Machine Covering. In: Erlebach, T., Persinao, G. (eds) Approximation and Online Algorithms. WAOA 2005. Lecture Notes in Computer Science, vol 3879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671411_9

Download citation

  • DOI: https://doi.org/10.1007/11671411_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32207-8

  • Online ISBN: 978-3-540-32208-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics