Analysis of multi-stage open shop processing systems

C.E.J. Eggermont, A. Schrijver, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)

Abstract

We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe system states. We show that it is easy to recognize system states that can be reached from the initial state (where the system is empty), but that in general it is hard to decide whether one given system state is reachable from another given system state. We show that the problem of identifying reachable deadlock states is hard in general open shop systems, but is easy in the special case where no job needs processing on more than two machines (by linear programming and matching theory), and in the special case where all machines have capacity one (by graph-theoretic arguments). Keywords: Scheduling; Resource allocation; Deadlock; Computational complexity
Original languageEnglish
Pages (from-to)331-348
Number of pages18
JournalMathematical Programming
Volume142
Issue number1-2
DOIs
Publication statusPublished - 2013

Fingerprint Dive into the research topics of 'Analysis of multi-stage open shop processing systems'. Together they form a unique fingerprint.

Cite this