IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v83y1998i0p1-2210.1023-a1018999711765.html
   My bibliography  Save this article

On the solution region for certainscheduling problems with preemption

Author

Listed:
  • Heidemarie Bräsel
  • Natalia Shakhlevich

Abstract

The paper deals with parallel machine and open shop scheduling problems with pre-emptions and an arbitrary nondecreasing objective function. An approach to describing the solution region for these problems and to reducing them to minimization over polytopes is proposed. Properties of the solution regions for certain problems are investigated. It is proved that open shop problems with unit processing times are equivalent to certain parallel machine problems, where preemption is allowed at arbitrary times. A polynomial algorithm is presented, transforming a schedule of one type into a schedule of the other type. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Heidemarie Bräsel & Natalia Shakhlevich, 1998. "On the solution region for certainscheduling problems with preemption," Annals of Operations Research, Springer, vol. 83(0), pages 1-22, October.
    • Handle: RePEc:spr:annopr:v:83:y:1998:i:0:p:1-22:10.1023/a:1018999711765
    DOI: 10.1023/A:1018999711765
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018999711765
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018999711765?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. Brasel, Heidemarie & Hennes, Holger, 2004. "On the open-shop problem with preemption and minimizing the average completion time," European Journal of Operational Research, Elsevier, vol. 157(3), pages 607-619, September.
    2. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.

    More about this item

    Statistics

    Access and download statistics

    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:annopr:v:83:y:1998:i:0:p:1-22:10.1023/a:1018999711765. 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.