Skip to main content

Scheduling with State-Dependent Machine Speed

  • Conference paper
  • First Online:
Approximation and Online Algorithms (WAOA 2015)

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

Included in the following conference series:

  • 534 Accesses

Abstract

We study a preemptive single machine scheduling problem where the machine speed is externally given and depends on the number unfinished jobs. The objective is to minimize the sum of weighted completion times. We develop a greedy algorithm that solves the problem to optimality when we work with either unit weights or unit processing times. If both weights and processing times are arbitrary, we show the problem is NP-hard by making a reduction from 3-partition.

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

Access this chapter

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

Institutional subscriptions

Similar content being viewed by others

References

  1. Albers, S.: Review articles: energy-efficient algorithms. Commun. ACM 53(5), 86–96 (2010)

    Article  MathSciNet  Google Scholar 

  2. Alidaee, B., Ahmadian, A.: Scheduling on a single processor with variable speed. Inf. Process. Lett. 60, 189–193 (1996)

    Article  MathSciNet  Google Scholar 

  3. Ayesta, U.: Scheduling (dagstuhl seminar 13111): scheduling with time-varying capacities. Dagstuhl Rep. 3(3), 29 (2013)

    Google Scholar 

  4. Bekker, R., Boxma, O.J.: An M/G/1 queue with adaptable service speed. Stochastic Models 23(3), 373–396 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bertrand, J.W.M., Ooijen, H.P.G.: Workload based order release and productivity : a missing link. Prod. Plan. Control : The Manage. Oper. 13(7), 665–678 (2002)

    Article  Google Scholar 

  6. Ewalid, A., Mintra, D.: Analysis and design of rate-based congestion control of high-speed networks, i: stochastic fluid models, access regulation. Queueing Syst. 9, 29–64 (1991)

    Article  Google Scholar 

  7. Ewalid, A., Mintra, D.: Statistical multiplexing with loss priorities in rate-based congestion control of high-speed networks. IEEE Trans. Commun. 42, 2989–3002 (1994)

    Article  Google Scholar 

  8. Demers, A.J., Yao, F.F., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS, pp. 374–382 (1995)

    Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)

    MATH  Google Scholar 

  10. Gawiejnowicz, S.: A note on scheduling on a single processor with speed dependent on a number of executed jobs. Inf. Process. Lett. 57, 297–300 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mandjes, M., Mintra, D.: A simple model of network access: feedback adaptation of rates and admission control. In: Proceedings of Infocom, pp. 3–12 (2002)

    Google Scholar 

  12. Megow, N., Verschae, J.: Dual techniques for scheduling on a machine with varying speed. In: Fomin, F.V., Freivalds, R.U., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 745–756. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  13. Boxma, O.J., Bekker, R., Borst, S.C., Kelly, O.: Queues with workload-dependent arrival and service rates. Queueing Syst. 46(3–4), 537–556 (2004)

    MathSciNet  MATH  Google Scholar 

  14. Ramanan, K.A., Weiss, A.: Sharing bandwidth in ATM. In: Proceedings of the Allerton Conference, pp. 732–740 (1997)

    Google Scholar 

  15. Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logist. Q. 3, 59–66 (1956)

    Article  Google Scholar 

Download references

Acknowledgements

We thank Urtzi Ayesta for helpful discussion after posing this open question during the Daghstuhl Seminar 13111 “Scheduling” in 2013. Furthermore, we thank the organizers of this seminar and Schloss Daghstuhl for providing the right atmosphere to facilitate research.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Veerle Timmermans .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Timmermans, V., Vredeveld, T. (2015). Scheduling with State-Dependent Machine Speed. In: Sanità, L., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2015. Lecture Notes in Computer Science(), vol 9499. Springer, Cham. https://doi.org/10.1007/978-3-319-28684-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28684-6_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28683-9

  • Online ISBN: 978-3-319-28684-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics