Skip to main content
Springer Nature Link
Log in

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

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

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

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

References

  • Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM, 23, 665–679.

    Article  Google Scholar 

  • Shchepin, E., & Vakhania, N. (2005). New tight NP-hardness of preemptive multiprocessor and open-shop scheduling. In Proceedings of 2nd multidisciplinary international conference on scheduling: theory and applications MISTA 2005 (pp. 606–629).

    Google Scholar 

  • Shchepin, E., & Vakhania, N. (2008). On the geometry, preemptions and complexity of multiprocessor and open shop scheduling. Annals of Operation Research, 159, 183–213.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Steklov Math. Inst., Gubkina 8, 117966, Moscow, Russia

    Evgeny V. Shchepin

  2. Science Faculty, State University of Morelos, Av. Universidad 1001, Cuernavaca, 62210, Morelos, Mexico

    Nodari Vakhania

Authors
  1. Evgeny V. Shchepin
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Nodari Vakhania
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Nodari Vakhania.

Additional information

E.V. Shchepin partially supported by the program “Algebraical and combinatorial methods of mathematical cybernetics” of the Russian Academy of Sciences.

N. Vakhania partially supported by CONACyT grant 48433.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shchepin, E.V., Vakhania, N. A note on the proof of the complexity of the little-preemptive open-shop problem. Ann Oper Res 191, 251–253 (2011). https://doi.org/10.1007/s10479-011-0975-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-011-0975-3

Keywords

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy