Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Shop scheduling problems with multiprocessor tasks on dedicated processors

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

Abstract

The computational complexity of shop scheduling problems with multiprocessor tasks on dedicated processors is investigated. The objective is makespan minimization. Preemption of tasks is not allowed. For open and flow-shop problems with three stages, complete classifications into polynomial solvable and NP-hard problems are given. These classifications depend on the compatibility structures of the problems. Furthermore, results for open-shop problems with unit processing times are derived. Finally, it is shown that most of the special cases of the job-shop problem which are polynomially solvable remain polynomially solvable in the multiprocessor task situation.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. L. Bianco, J. Blażewicz, P. Dell'Olmo and M. Drozdowski, Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness, Inf. Proc. Lett. 46(1993)109–113.

    Google Scholar 

  2. L. Bianco, P. Dell'Olmo and M.G. Speranza, Nonpreemptive scheduling of independent tasks with prespecified processor allocation, Naval Res. Log. 41(1994)959–971.

    Google Scholar 

  3. J. Blażewicz, P. Dell'Olmo, M. Drozdowski and M.G. Speranza, Scheduling multiprocessor tasks on three dedicated processors, Inf. Proc. Lett. 41(1992)275–280.

    Google Scholar 

  4. J. Blażewicz, K. Ecker, G. Schmidt and J. Weglarz,Scheduling in Computer and Manufacturing Systems (Springer, Berlin, 1993).

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  7. P. Brucker, B. Jurisch and M. Jurisch, Open shop problems with unit time operations, Zeits. Oper. Res. 37(1993)59–73.

    Google Scholar 

  8. H.N. Gabow and O. Kariv, Algorithms for edge colouring bipartite graphs and multigraphs, SIAM J. Comp. 11(1982)117–129.

    Google Scholar 

  9. M.R. Garey and D.S. Johnson, Strong NP-completeness results: motivation, examples and implications, J. ACM 25(1978)499–508.

    Google Scholar 

  10. M.R. Garey and D.S. Johnson,Computers and Intractability (Freemann, San Francisco, 1979).

    Google Scholar 

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

    Google Scholar 

  12. T. Gonzales and S. Sahni, Flowshop and jobshop schedules: complexity and approximation, Oper. Res. 26(1978)36–52.

    Google Scholar 

  13. 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, Ann. Discr. Math. 5(1979)287–326.

    Google Scholar 

  14. J.A. Hoogeveen, S.L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocation, Discr. Appl. Math. (1992), to appear.

  15. J.R. Jackson, An extension of Johnson's results on job lot scheduling, Naval Res. Log. Quart. 3(1956)201–203.

    Google Scholar 

  16. S.M. Johnson, Optimal two- and three stage production schedules with setup times included, Naval Res. Log. Quart. 1(1954)61–68.

    Google Scholar 

  17. M. Kubale, Preemptive scheduling of two-processor tasks on dedicated processors, Zeszyty Naukowe Politechnik: Slaskiej, Seria: Automatyka Z. 100, No. 1082(1990)145–153, in polish.

  18. W. Kubiak, S. Sehti and C. Sriskandarajah, An efficient algorithm for a job shop problem, Ann. Oper. Res. (1995), this volume.

  19. H.W. Lenstra, Jr., Integer programming with a fixed number of variables, Math. Oper. Res. 8(1983)538–548.

    Google Scholar 

  20. Y.N. Sotskov and N.V. Shakhlevich, NP-hardness of shop-scheduling problems with three jobs, to appear in Discr. Appl. Math. (1993).

  21. V.G. Timkowskiy, Polynomial-time algorithm for the Lenstra-Rinnooy Kan two-machine scheduling problem, Kibernetika 2(1985)109–111, in Russian.

    Google Scholar 

  22. B. Veltman, B.J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays, Parallel Comp. 16(1990)173–182.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Osnabrück, D-49069, Osnabrück, Germany

    Peter Brucker & Andreas Krämer

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Krämer
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the Deutsche Forschungsgemeinschaft, Project JoPTAG.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Krämer, A. Shop scheduling problems with multiprocessor tasks on dedicated processors. Ann Oper Res 57, 13–27 (1995). https://doi.org/10.1007/BF02099688

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02099688

Keywords

Search

Navigation