Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1993: Mathematical Foundations of Computer Science 1993 pp 291–300Cite as

On the complexity of scheduling incompatible jobs with unit-times

  • Conference paper
  • First Online:

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

Abstract

We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal of Computing 4 (1985) 926–934

    Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    Google Scholar 

  3. Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)

    Google Scholar 

  4. Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular arc graphs. Networks 12 (1982) 459–467

    Google Scholar 

  5. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, Thatcher (eds.): Complexity of computer computations, Plenum Press (1972) 85–104

    Google Scholar 

  6. Lonc, Z.: On complexity of some chain and antichain partition problems. WG Conference, LNCS (1991) 97–104

    Google Scholar 

  7. Papadimitriou, C.H., Yannakakis, M.: Scheduling interval-ordered tasks. SIAM Journal of Computing 8 (1979) 405–409

    Google Scholar 

  8. Scinsche, D.: On a property of the class of n-colorable graphs. Journal of Combinatoral Theory B 16 (1974) 191–193

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht, The Netherlands

    Hans L. Bodlaender

  2. Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier, Germany

    Klaus Jansen

Authors
  1. Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bodlaender, H.L., Jansen, K. (1993). On the complexity of scheduling incompatible jobs with unit-times. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation