IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v49y1999i1p41-76.html
   My bibliography  Save this article

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

Author

Listed:
  • Peter Brucker
  • Svetlana A. Kravchenko
  • Yuri N. Sotskov

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. Copyright Springer-Verlag Berlin Heidelberg 1999

Suggested Citation

  • Peter Brucker & Svetlana A. Kravchenko & Yuri N. Sotskov, 1999. "Preemptive job-shop scheduling problems with a fixed number of jobs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(1), pages 41-76, March.
  • Handle: RePEc:spr:mathme:v:49:y:1999:i:1:p:41-76
    DOI: 10.1007/PL00020906
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/PL00020906
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/PL00020906?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Peter Brucker & Yu Sotskov & Frank Werner, 2007. "Complexity of shop-scheduling problems with fixed number of jobs: a survey," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(3), pages 461-481, June.
    2. Yuri N. Sotskov, 2020. "Mixed Graph Colorings: A Historical Review," Mathematics, MDPI, vol. 8(3), pages 1-24, March.
    3. Martin Middendorf & Vadim G. Timkovsky, 1999. "Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 417-435, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:49:y:1999:i:1:p:41-76. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.