Skip to main content
SpringerLink
Log in

Polynomial Algorithms for MPSP Using Parametric Linear Programming

  • Chapter
Logic versus Approximation

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

  • 584 Accesses

Abstract

The multiprocessor scheduling problem(MPSP), P|prec,p j =1|C max , is known to be NP-complete. The problem is polynomially solvable, however, if the precedence relations are of the intree(outtree) type, P|intree(outtree),p j =1|C max , or if the number of processors is two, P2|prec,p j =1|C max . In this paper, we introduce a parametric linear program which gives a lower bound for the makespan of MPSP and retrieves the makespans of the two polynomially solvable problems.

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 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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. Coffman Jr., E.G., Graham, R.L.: Optimal Scheduling for Two-Processor Systems. Acta Informatica 1, 200–213 (1972)

    Article  MathSciNet  Google Scholar 

  2. Fernandez, E.B., Bussel, B.: Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules. IEEE Trans. on Comput. 22, 745–751 (1973)

    Article  Google Scholar 

  3. Fuji, M., Kasami, T., Ninomiya, K.: Optimal sequencing on two equivalent processors. SIAM J. Appl. Math. 17, 784–789 (1969); Erratum 20, 141 (1971)

    Article  MathSciNet  Google Scholar 

  4. Gabow, H.N.: An Almost-Linear Algorithm for Two-Processor Scheduling. J. Assoc. Comput. Mach. 29, 766–780 (1982)

    MATH  MathSciNet  Google Scholar 

  5. Gabow, H.N., Tarjan, R.E.: A Linear-Time algorithm for a Special Case of Disjoint Set Union. J. Comput. System Sci. 30, 209–221 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S., Tarjan, R.E., Yannakakis, M.: Scheduling opposing forests. SIAM J. Alg. Disc. Math. 4, 72–93 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hu, T.C.: Parallel Sequencing and Assembly Line Problems. Operation Research 9, 841–848 (1961)

    Article  Google Scholar 

  8. Sethi, R.: Scheduling Graphs on Two-Processors. SIAM J. Compute. 5, 73–82 (1976)

    Article  MathSciNet  Google Scholar 

  9. Ulmann, J.D.: NP-Complete Scheduling Problems. J. Comput. System Sci. 10, 384–393 (1975)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck Institut für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken, Germany

    Babak Mougouie

Authors
  1. Babak Mougouie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Kaiserslautern, P.O. Box 3049, D-67653, Kaiserslautern

    Wolfgang Lenski

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mougouie, B. (2004). Polynomial Algorithms for MPSP Using Parametric Linear Programming. In: Lenski, W. (eds) Logic versus Approximation. Lecture Notes in Computer Science, vol 3075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25967-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25967-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22562-1

  • Online ISBN: 978-3-540-25967-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation