Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs

N.V. Shakhlevich, N. Sotskov and F. Werner

Annals of Operations Research, 1999, vol. 92, issue 0, 304 pages

Abstract: The paper deals with the determination of an optimal schedule for the so‐calledmixed‐shopproblem when the makespan has to be minimized. In such a problem, some jobs havefixed machine orders (as in the job‐shop), while the operations of the otherjobs may be processed in arbitrary order (as in the open‐shop). We provebinary NP‐hardness of the preemptive problem with three machines and three jobs(two jobs have fixed machine orders and one may have an arbitrary machine order).We answer all other remaining open questions on the complexity status of mixed‐shopproblems with the makespan criterion by presenting different polynomial and pseudopolynomial algorithms. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018943016617 (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:92:y:1999:i:0:p:281-304:10.1023/a:1018943016617

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

DOI: 10.1023/A:1018943016617

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