Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Informatics

SOFSEM 2020: SOFSEM 2020: Theory and Practice of Computer Science pp 199–210Cite as

Online Scheduling with Machine Cost and a Quadratic Objective Function

  • Conference paper
  • First Online:

  • 960 Accesses

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

Abstract

We will consider a quadratic variant of online scheduling with machine cost. Here, we have a sequence of independent jobs with positive sizes. Jobs come one by one and we have to assign them irrevocably to a machine without any knowledge about additional jobs that may follow later on. Owing to this, the algorithm has no machine at first. When a job arrives, we have the option to purchase a new machine and the cost of purchasing a machine is a fixed constant. In previous studies, the objective was to minimize the sum of the makespan and the cost of the purchased machines. Now, we minimize the sum of squares of loads of the machines and the cost paid to purchase them and we will prove that 4/3 is a general lower bound. After this, we will present a 4/3-competitive algorithm with a detailed competitive analysis.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Dósa, Gy., He, Y.: Better online algorithms for scheduling with machine cost. SIAM J. Comput. 33(5), 1035–1051 (2004)

    Article  MathSciNet  Google Scholar 

  2. Dósa, Gy., He, Y.: Scheduling with machine cost and rejection. J. Comb. Optim. 12(4), 337–350 (2006)

    Article  MathSciNet  Google Scholar 

  3. Dósa, Gy., Imreh, Cs.: The generalization of scheduling with machine cost. Theoret. Comput. Sci. 510, 102–110 (2013)

    Article  MathSciNet  Google Scholar 

  4. Dósa, Gy., Tan, Z.: New upper and lower bounds for online scheduling with machine cost. Discrete Optim. 7(3), 125–135 (2010)

    Article  MathSciNet  Google Scholar 

  5. Han, S., Jiang, Y., Hu, J.: Online algorithms for scheduling with machine activation cost on two uniform machines. J. Zhejiang Univ.-Sci. A 8(1), 127–133 (2007)

    Article  Google Scholar 

  6. He, Y., Cai, S.: Semi-online scheduling with machine cost. J. Comput. Sci. Technol. 17(6), 781–787 (2002)

    Article  MathSciNet  Google Scholar 

  7. Imreh, Cs.: Online scheduling with general machine cost functions. Discrete Appl. Math. 157(9), 2070–2077 (2009)

    Article  MathSciNet  Google Scholar 

  8. Imreh, C., Noga, J.: Scheduling with machine cost. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) APPROX/RANDOM -1999. LNCS, vol. 1671, pp. 168–176. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-540-48413-4_18

    Chapter  Google Scholar 

  9. Nagy-György, J., Imreh, Cs.: Online scheduling with machine cost and rejection. Discrete Appl. Math. 155(18), 2546–2554 (2007)

    Article  MathSciNet  Google Scholar 

  10. Szwarc, W., Mukhopadhyay, S.K.: Minimizing a quadratic cost function of waiting times in single-machine scheduling. J. Oper. Res. Soc. 46(6), 753–761 (1995)

    Article  Google Scholar 

  11. Townsend, W.: The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manage. Sci. 24(5), 530–534 (1978)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, Szeged, 6720, Hungary

    J. Csirik & D. Kószó

  2. Department of Mathematics, University of Pannonia, Egyetem u. 10, Veszprém, 8200, Hungary

    Gy. Dósa

Authors
  1. J. Csirik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gy. Dósa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Kószó
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Csirik .

Editor information

Editors and Affiliations

  1. University of Macedonia, Thessaloniki, Greece

    Alexander Chatzigeorgiou

  2. University of Bergamo, Bergamo, Italy

    Riccardo Dondi

  3. Cyprus University of Technology, Limassol, Cyprus

    Herodotos Herodotou

  4. Carnegie Mellon University Qatar, Doha, Qatar

    Christos Kapoutsis

  5. Open University of Cyprus, Nicosia, Cyprus

    Yannis Manolopoulos

  6. University of Cyprus, Nicosia, Cyprus

    George A. Papadopoulos

  7. Paris Dauphine University, Paris, France

    Florian Sikora

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Csirik, J., Dósa, G., Kószó, D. (2020). Online Scheduling with Machine Cost and a Quadratic Objective Function. In: Chatzigeorgiou, A., et al. SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science(), vol 12011. Springer, Cham. https://doi.org/10.1007/978-3-030-38919-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38919-2_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38918-5

  • Online ISBN: 978-3-030-38919-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation