Skip to main content
SpringerLink
Log in

Scheduling on Uniform Nonsimultaneous Parallel Machines

  • Conference paper
  • First Online:
Operations Research Proceedings 2016

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

We consider the problem of scheduling on uniform processors which may not start processing at the same time with the purpose of minimizing the maximum completion time. We provide a variant of the MULTIFIT algorithm which generates schedules which end within 1.382 times the optimal maximum completion time for the general problem, and within \(\sqrt{6}/2\) times the optimal maximum completion time for problem instances with two processors. Experimental results suggest that our algorithm is a viable option for addressing this problem in practice.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: An application of Bin-Packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1–17 (1978)

    Article  Google Scholar 

  2. Lee, C.Y.: Parallel Machine Scheduling with nonsimultaneous machine available time. Discrete Appl. Math. 30(1), 53–61 (1991)

    Google Scholar 

  3. Chang, S.Y., Hwang, H.: The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines. Discrete Appl. Math. 92, 135–147 (1999)

    Article  Google Scholar 

  4. Hwang, H.C., Lim, K.: Discrete Appl. Math. 167, 172–187 (2014)

    Article  Google Scholar 

  5. Friesen, D.K., Langston, M.A.: Bounds for multifit scheduling on uniform processors. SIAM J. Comput. 12(1), 60–69 (1983)

    Article  Google Scholar 

  6. Chen, B.: Tighter bound for MULTIFIT scheduling on uniform processors. Discrete Appl. Math. 31(3), 227–260 (1991)

    Google Scholar 

  7. Burkard, R.E., He, Y.: A note on MULTIFIT scheduling for uniform machines. Computing 61(3), 277–283 (1998)

    Article  Google Scholar 

  8. He, Y.: Uniform machine scheduling with machine available constraints. Acta Math. Appl. Sin. (English Series), 16(2), 122–129 (2000)

    Google Scholar 

  9. Grigoriu, L., Friesen, D.K.: Approximation for scheduling on uniform nonsimultaneous parallel machines. J. Sched. (2016). doi:10.1007/s10951-016-0501-1

  10. Grigoriu, L., Friesen, D.K.: Scheduling on uniform processors with at most one downtime on each machine. Discrete Optim. 17, 14–24 (2015)

    Article  Google Scholar 

  11. Grigoriu, L.: Scheduling on parallel machines with variable availability patterns. Ph.D. thesis, Politehnica University Bucharest (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät Für Wirtschaftswissenschaften, Wirtschaftsinformatik Und Wirtschaftsrecht, Universität Siegen, Kohlbettstr. 15, 57068, Siegen, Germany

    Liliana Grigoriu

  2. Department of Computer Science, Texas A&M University, College Station, TX, 77840-3112, USA

    Donald K. Friesen

Authors
  1. Liliana Grigoriu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Donald K. Friesen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liliana Grigoriu .

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Helmut Schmidt University, Institute of Computer Science, Hamburg, Germany

    Andreas Fink

  2. Applied Mathematics, Helmut Schmidt University, Applied Mathematics, Hamburg, Germany

    Armin Fügenschuh

  3. Institute of Logistics and Organization, Helmut Schmidt University, Institute of Logistics and Organization, Hamburg, Germany

    Martin Josef Geiger

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Grigoriu, L., Friesen, D.K. (2018). Scheduling on Uniform Nonsimultaneous Parallel Machines. In: Fink, A., Fügenschuh, A., Geiger, M. (eds) Operations Research Proceedings 2016. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-55702-1_62

Download citation

Publish with us

Policies and ethics

Search

Navigation