Preemptive job-shop scheduling problems with a fixed number of jobs | Mathematical Methods of Operations Research Skip to main content
Springer Nature Link
Log in

Preemptive job-shop scheduling problems with a fixed number of jobs

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

It is shown that the two machine preemptive job-shop problem with mean flow-time or makespan objective function and three jobs is NP-hard. This contrasts the fact that the nonpreemptive versions of these problems are polynomially solvable if the number of jobs is arbitrary but fixed. It is also shown that the preemptive problems can be solved pseudopolynomially if both the number of machines and the number of jobs is fixed.

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
¥17,985 /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 includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. FB Mathematik/Informatik, Universität Osnabrück, D-49069 Osnabrück, Germany (e-mail: peter@mathematik.uni-osnabrueck.de), , , , , , DE

    Peter Brucker

  2. Institute of Engineering Cybernetics, Surganov Str. 6, 220012 Minsk, Belarus (e-mail: kravchen@newman.basnet.minsk.by; sotskov@newman.basnet.minsk.by), , , , , , XX

    Svetlana A. Kravchenko & Yuri N. Sotskov

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Svetlana A. Kravchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuri N. Sotskov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: November 1996/final version received: January 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Kravchenko, S. & Sotskov, Y. Preemptive job-shop scheduling problems with a fixed number of jobs. Mathematical Methods of OR 49, 41–76 (1999). https://doi.org/10.1007/PL00020906

Download citation

  • Issue Date:

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

Search

Navigation