Skip to main content
SpringerLink
Log in

On scheduling problems restricted to interval orders

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1992)

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

Included in the following conference series:

  • 1740 Accesses

Abstract

In this paper we analyse a scheduling problem where each processor can execute only a subset of all unit-time jobs. We show that this problem is NP-complete even for interval orders. If each job has a specified type and processors can only execute jobs with one type, the problem can be solved in polynomial time. The same holds if the deadline is constant. At last we give a heuristic for the scheduling problem restricted to an interval order with logarithmic approximation bound.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernstein, D., Rodeh, M., Gertner, I.: On the complexity of scheduling problems for parallel pipelined machines. IEEE Trans. on Comput. 38 (1989) 1308–1313

    Google Scholar 

  2. Chang, R.S., Lee, C.T.: On a scheduling problem where a job can be executed only by a limited number of processors. Comput. Opns. Res. 15 (1988) 471–478

    Google Scholar 

  3. Chen, Y.L., Chin, Y.H.: Scheduling unit-time jobs on processors with different capabilities. Comput. Opns. Res. 16 (1989) 409–417

    Google Scholar 

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

    Google Scholar 

  5. Goyal, D.K.: Scheduling processor bound systems. Technical Report Washington State University, Pullman CS-76-036 (1976)

    Google Scholar 

  6. Hu, T.C.: Parallel sequencing and assembly line problems. Opns Res. 9 (1961) 841–848

    Google Scholar 

  7. Jansen, K.: Analyse of scheduling problems with typed task systems. (submitted)

    Google Scholar 

  8. Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9 (1974) 256–278

    Google Scholar 

  9. Kellerer, H., Woeginger, G.J.: UET-scheduling with constrained processor allocation. Comput. Opns. Res. 19 (1992) 1–8

    Google Scholar 

  10. Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Opns Res. 26 (1978) 22–35

    Google Scholar 

  11. Papadimitriou, C.H., Yannakakis, M.: Scheduling interval-ordered tasks. SIAM J. Comput. 8 (1979) 405–409

    Google Scholar 

  12. Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10 (1975) 384–393

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Klaus Jansen

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernst W. Mayr

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jansen, K. (1993). On scheduling problems restricted to interval orders. In: Mayr, E.W. (eds) Graph-Theoretic Concepts in Computer Science. WG 1992. Lecture Notes in Computer Science, vol 657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56402-0_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-56402-0_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47554-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation