Skip to main content
SpringerLink
Log in

Complexity of scheduling problems with multi-purpose machines

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In a multi-purpose machine scheduling problem, jobs or operations can be processed by any machine of prespecified subsets of the machine set. In this paper, we study the computational complexity of such scheduling problems. We study scheduling problems with identical and uniform machines as well as problems with shop characteristics.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network flows, in: Handbooks in Operations Research and Management Science, Vol. 1: Optimization, G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, eds., North-Holland, Amsterdam, 1989, pp. 211–369.

    Google Scholar 

  2. S.B. Akers, A graphical approach to production scheduling problems, Operations Research 4(1956) 244–245.

    Google Scholar 

  3. J. Blażewicz, W. Cellary, R. Slowinski and J. Weglarz, Scheduling under resource constraints: Deterministic models, J.C. Baltzer, Basel, 1986.

    Google Scholar 

  4. P. Brandimarte, Routing and scheduling in a flexible job shop by tabu search, Annals of Operations Research 41(1993)157–183.

    Article  Google Scholar 

  5. P. Brucker, An efficient algorithm for the job-shop problem with two jobs, Computing 40(1988) 353–359.

    Article  Google Scholar 

  6. P. Brucker, A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs, OR Spektrum 16(1994)5–7.

    Article  Google Scholar 

  7. P. Brucker and A. Krämer, Polynomial algorithms for resource constrained and multiprocessor task scheduling problems with a fixed number of task types, European Journal of OR 90(1996)214–226.

    Article  Google Scholar 

  8. P. Brucker and R. Schlie, Job-shop scheduling with multi-purpose machines, Computing 45(1990) 369–375.

    Article  Google Scholar 

  9. J.L. Bruno, E.G. Coffman, Jr. and R. Sethi, Scheduling independent tasks to reduce mean finishing time, Comm. ACM 17(1974)382–387.

    Article  Google Scholar 

  10. Y. Cho and S. Sahni, Preemptive scheduling of independent jobs with release and due times on open, flow and job shops, Operations Research 29(1981)511–522.

    Google Scholar 

  11. J. Du, J.Y.-T. Leung and C.S. Wong, Minimizing the number of late jobs with release time constraints, J. Combin. Math. Combin. Comput. 11(1992)97–107.

    Google Scholar 

  12. J. Du, J.Y.-T. Leung and G.H. Young, Minimizing mean flow time with release time constraints, Technical Report, Computer Science Program, University of Texas, Dallas, 1988.

    Google Scholar 

  13. M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freemann, San Francisco, 1979.

    Google Scholar 

  14. T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, J. ACM 23(1976) 665–679.

    Article  Google Scholar 

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

    Google Scholar 

  16. J.A. Hoogeveen, S.L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocation, Discrete Applied Mathematics 55(1995)259–272.

    Article  Google Scholar 

  17. J.E. Hopcraft and R.M. Karp, An n 5/2 algorithm for maximum matching in bipartite graphs, SIAM Journal on Computing 2(1973)225–231.

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. W.A. Horn, Some simple scheduling algorithms, Naval Research Logistics Quarterly 21(1974) 177–185.

    Google Scholar 

  20. J. Hurink, B. Jurisch and M. Thole, Tabu search for the job-shop scheduling problem with multipurpose machines, OR Spektrum 15(1994)205–215.

    Article  Google Scholar 

  21. B. Jurisch, Scheduling jobs in shops with multi-purpose machines, Ph.D. Dissertation, Fachbereich Mathematik/Informatik, Universität Osnabrück, 1992.

  22. B. Jurisch, Lower bounds for the job-shop scheduling problemon multi-purpose machines, Discrete Applied Mathematics 58(1995)145–156.

    Article  Google Scholar 

  23. E.L. Lawler, Recent results in the theory of machine scheduling, in: Mathematical Programming: The State of the Art, A. Bachem, M. Grötschel and B. Korte, eds., Springer, Berlin, 1983, pp. 202–234.

    Google Scholar 

  24. E.L. Lawler and J. Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming, J. ACM 25(1978)612–619.

    Article  Google Scholar 

  25. E.G. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, S.C. Graves, A.H.G. Rinnooy Kan and P. Zipkin, eds., North-Holland, Amsterdam, 1993, pp. 445–522.

    Google Scholar 

  26. V.M. Malhotra, M.P. Kumar and S.N. Maheshwari, An O(|V|3) algorithm for finding maximum flows in networks, Information Processing Letters 7(1978)277–278

    Article  Google Scholar 

  27. R. McNaughton, Scheduling with deadlines and loss functions, Management Science 6(1959) 1–12.

    Google Scholar 

  28. W. Meyer, Geometrische Methoden zur Lösung von Job-Shop Problemen und deren Verallgemeinerungen, Ph.D. Dissertation, Fachbereich Mathematik/Informatik, Universität Osnabrück, 1992.

  29. G. Vairaktarakis and S. Sahni, Dual criteria preemptive open shop problems with minimum makespan, Naval Research Logistics 42(1995)103–121.

    Google Scholar 

Download references

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Jurisch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Krämer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Jurisch, B. & Krämer, A. Complexity of scheduling problems with multi-purpose machines. Annals of Operations Research 70, 57–73 (1997). https://doi.org/10.1023/A:1018950911030

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018950911030

Keywords

Search

Navigation