IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v191y2011i1p251-25310.1007-s10479-011-0975-3.html
   My bibliography  Save this article

A note on the proof of the complexity of the little-preemptive open-shop problem

Author

Listed:
  • Evgeny Shchepin
  • Nodari Vakhania

Abstract

We give a complement note on the proof of the NP-hardness of preemptive acyclic open-shop problem presented earlier by the authors in Ann. Oper. Res. 159:183–213, 2008 . Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Evgeny Shchepin & Nodari Vakhania, 2011. "A note on the proof of the complexity of the little-preemptive open-shop problem," Annals of Operations Research, Springer, vol. 191(1), pages 251-253, November.
  • Handle: RePEc:spr:annopr:v:191:y:2011:i:1:p:251-253:10.1007/s10479-011-0975-3
    DOI: 10.1007/s10479-011-0975-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-0975-3
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-011-0975-3?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.

    References listed on IDEAS

    as
    1. Evgeny Shchepin & Nodari Vakhania, 2008. "On the geometry, preemptions and complexity of multiprocessor and shop scheduling," Annals of Operations Research, Springer, vol. 159(1), pages 183-213, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Research on permutation flow shop scheduling problems with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 211(1), pages 473-480, December.
    2. Alan J. Soper & Vitaly A. Strusevich, 2022. "Preemptive and non-preemptive scheduling on two unrelated parallel machines," Journal of Scheduling, Springer, vol. 25(6), pages 659-674, December.
    3. Alan J. Soper & Vitaly A. Strusevich, 2021. "Parametric analysis of the quality of single preemption schedules on three uniform parallel machines," Annals of Operations Research, Springer, vol. 298(1), pages 469-495, March.
    4. Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Some results of the worst-case analysis for flow shop scheduling with a learning effect," Annals of Operations Research, Springer, vol. 211(1), pages 481-490, December.
    5. 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.

    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:191:y:2011:i:1:p:251-253:10.1007/s10479-011-0975-3. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.