多阶段开放车间处理系统的分析
Analysis of multi-stage open shop processing systems
AI总结:
研究多阶段开放车间系统中的可达性和死锁检测问题,通过线性规划、匹配理论和图论方法刻画安全与不安全状态,并证明一般情况下的难度及特殊情况下的易解性。
摘要:
我们研究多阶段开放车间处理系统中的算法问题,这些问题的核心是可达性和死锁检测。我们刻画了安全和不安全的系统状态。我们表明,从初始状态(系统为空)可达的系统状态很容易识别,但一般来说,判断一个给定系统状态是否从另一个给定系统状态可达是困难的。我们证明,在一般的开放车间系统中,识别可达死锁状态的问题是困难的,但在没有作业需要在超过两台机器上加工的特殊情况下(通过线性规划和匹配理论),以及在所有机器容量均为1的特殊情况下(通过图论论证),该问题是容易的。
英文摘要:
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).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。