Skip to main content
SpringerLink
Log in

Scheduling with Machine Cost

  • Conference paper
Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques (RANDOM 1999, APPROX 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1671))

Abstract

For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. We consider two basic online scheduling problems with the modification that initially the algorithm possesses no machines, but that at any point additional machines may be purchased. Upper and lower bounds on the competitive ratio are shown for both problems.

Research supported by the START program Y43-MAT of the Austrian Ministry of Science.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers, S.: Better bounds for online scheduling. In: Proc. 29th Symp. Theory of Computing, pp. 130–139 (1997)

    Google Scholar 

  2. Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. In: Proc. 8th Symp. On Discrete Algorithms, pp. 609–618 (1997)

    Google Scholar 

  3. Chen, B., van Vliet, A., Woeginger, G.J.: New lower and upper bounds for on-line scheduling. Operations Research Letters 16, 221–230 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen, B., Vestjens, A.P.A.: Scheduling on identical machines: How good is LPT in an on-line setting? Operations Research Letters 21, 165–169 (1998)

    Article  MathSciNet  Google Scholar 

  5. Galambos, G., Woeginger, G.J.: An on-line scheduling heuristic with better worst case ratio than Graham’s list scheduling. SIAM Journal on Computing 22, 349–355 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)

    Google Scholar 

  7. Noga, J., Seiden, S.: Scheduling two machines with release times. To appear at Integer Programming and Combinatorial Optimization (1999)

    Google Scholar 

  8. Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines on-line. SIAM Journal on Computing 24, 1313–1331 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, József Attila University, Szeged, Hungary

    Csanád Imreh

  2. Stochastic Research Group, Hungarian Academy of Sciences, Technical University, Budapest, Hungary

    Csanád Imreh

  3. Mathematics Department, Technical University Graz, Graz, Austria

    John Noga

Authors
  1. Csanád Imreh
    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

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley

    Dorit S. Hochbaum

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Centre Universitaire d’Informatique, Battelle Bâtiment A, Route de Drize 7, 1227, Carouge, Geneva, Switzerland

    José D. P. Rolim

  4. Computer Science Division, University of California, 94720, Berkeley, CA

    Alistair Sinclair

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Imreh, C., Noga, J. (1999). Scheduling with Machine Cost. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48413-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66329-4

  • Online ISBN: 978-3-540-48413-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation