Skip to main content
SpringerLink
Log in

Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2001)

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

Abstract

We show that the problems of minimizing total completion time and of minimizing the number of late jobs on unrelated parallel machines, when preemption is allowed, are both NP-hard in the strong sense. The former result settles a long-standing open question.

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. P. Brucker and S.A. Kravchenko: Preemption can make parallel machine scheduling problems hard, Osnabruecker Schriften zur Mathematik, Reihe P (Preprints), Heft 211, (1999).

    Google Scholar 

  2. P. Brucker, S.A. Kravchenko and Y.N. Sotskov, Preemptive job-shop scheduling problems with a fixed number of jobs, Mathematical Methods of Operations Research 49 (1999), 41–76.

    MATH  MathSciNet  Google Scholar 

  3. J. Bruno, E.G. Coman Jr, R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM 17 (1974), 382–387.

    Article  MATH  Google Scholar 

  4. J. Du and J.Y.-T. Leung, Minimizing the number of late jobs on unrelated machines, Operations Research Letters 10 (1991), 153–158.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Du, J.Y.-T. Leung, Minimizing mean flow time with release time constraints, Theoretical Computer Science 75 (1990) 347–355.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Du, J.Y.-T. Leung, G.H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow time, Information and Computation 92 (1991) 219–236.

    Article  MATH  MathSciNet  Google Scholar 

  7. Gonzalez, Optimal mean finish time preemptive schedules, Technical Report 220, Computer Science Department, Pennsylvania State University (1977).

    Google Scholar 

  8. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics 4 (1979), 287–326.

    Article  Google Scholar 

  9. W.A. Horn, Minimizing average flow time with parallel machines, Operations Research 21 (1973), 846–847.

    Article  MATH  Google Scholar 

  10. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York (1972), 85–103.

    Google Scholar 

  11. S.A. Kravchenko, Y.N. Sotskov, Optimal makespan schedule for three jobs on two machines, Mathematical Methods of Operations Research 43 (1996), 233–238.

    Article  MATH  MathSciNet  Google Scholar 

  12. E.L. Lawler, J. Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming, Journal of the Association for Computing Machinery 25 (1978), 612–619.

    MATH  MathSciNet  Google Scholar 

  13. E.L. Lawler, Recent results in the theory of machine scheduling, in: A. Bachem, M. Grötchel and B. Korte (eds.), Mathematical Programming: the State of the Art-Bonn 1982, Springer, Berlin-New York (1983), 202–234.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 513, 5600, MB Eindhoven, The Netherlands

    René Sitters

Authors
  1. René Sitters
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituut voor Informatica en Informatiekunde, Universiteit Utrecht, Padualaan 14, 3584, CH Utrecht, The Netherlands

    Karen Aardal

  2. CWI, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands

    Bert Gerards

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sitters, R. (2001). Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45535-3_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42225-9

  • Online ISBN: 978-3-540-45535-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation