文章基本信息

标题：Analysis of multi-stage open shop processing systems
本地全文：下载
作者：Christian E.J. Eggermont ; Alexander Schrijver ; Gerhard J. Woeginger 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2011
卷号：9
页码：484-494
DOI：10.4230/LIPIcs.STACS.2011.484
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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).
关键词：scheduling; resource allocation; deadlock; computational complexity