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

Evgeny Shchepin () and Nodari Vakhania ()

Annals of Operations Research, 2011, vol. 191, issue 1, 253 pages

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

Keywords: Open-shop scheduling; Preemption; Algorithm; NP-hardness (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-0975-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:191:y:2011:i:1:p:251-253:10.1007/s10479-011-0975-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-011-0975-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().