Analysis of multi-stage open shop processing systems

Christian Eggermont (1) , Alexander Schrijver (2) , Gerhard Woeginger (1)

1 Department of mathematics and computing science [Eindhoven]
2 CWI - Centrum voor Wiskunde en Informatica

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

Mots clés: Scheduling; resource allocation; deadlock; computational complexity

Domaines: Complexité [cs.CC]; Algorithme et structure de données [cs.DS]

Christian Eggermont, Alexander Schrijver, Gerhard Woeginger. Analysis of multi-stage open shop processing systems. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.484-494. ⟨hal-00573597⟩