New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

Michael Andresen () and Tanka Dhamala ()

Annals of Operations Research, 2012, vol. 196, issue 1, 26 pages

Abstract: We consider the problem of minimizing the makespan in open shop scheduling. The decision problem whether a given sequence in open shop scheduling is irreducible has already been considered, however, has not been solved yet. A sequence is an acyclic orientation of the Hamming graph K n ×K m . Irreducible sequences in open shop are the local optimal elements. We present two variants of algorithms based on the specific properties of the H-comparability graph. The first is polynomial whereas the second is exponential. The irreducibility is co-NP. The stated properties argue whether it belongs to P. The complexity status of the considered decision problem is updated. Copyright Springer Science+Business Media, LLC 2012

Keywords: Scheduling; Open shop; Comparability graph; Reducibility; Complexity (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-012-1075-8 (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:196:y:2012:i:1:p:1-26:10.1007/s10479-012-1075-8

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

DOI: 10.1007/s10479-012-1075-8

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 ().