The throughput rate of multistation unreliable production lines
The throughput rate of multistation unreliable production lines
复制标题
多工位不可靠生产线的吞吐率
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
C.
中科院分区：
文献类型：
--
作者：
C.
本文研究不可靠多工位串联生产线。第一站永远不会挨饿，最后一站永远不会堵塞。每个站i的处理时间是Erlang类型Pi，Pi是相位数，允许每个站变化。在连续的站之间允许不同容量的缓冲器。一个电台可能可靠或不可靠。故障时间是指数分布和修复时间是Erlang型的分布与R i允许变化，在每个站。本文提出了一种生成相关线性方程组的方法。这些线性方程组通过使用连续超松弛（SOR）方法求解，该方法具有Seelen [25]使用的动态调整松弛因子。参考生产线的生产率，许多数值案例解决和记录。这些精确的结果是用于比较的目的，对近似结果存在于文献中。虽然获得了许多新的结果，但所能求解的系统的大小固有地受到所使用的技术的限制。这是由于维数灾难。
This paper is concerned with unreliable multistation series production lines. The first station is never starved and the last station is never blocked. The processing times at each station i is Erlang type Pi distributed with Pi, the number of phases, allowed to vary for each station. Buffers of nonidentical capacities are allowed between successive stations. A station maybe reliable or unreliable. Time to failure is exponentially distributed and repair times are Erlang type R i distributed with R i allowed to vary, at each station. In this paper a methodology for generating the associated set of linear equations is presented. These set of linear equations are solved via the use of the Successive Over-Relaxation (SOR) method with a dynamically adjusted relaxation factor as used by Seelen [25]. Referring to the throughput rate of the production lines, many numerical cases are solved and documented. These exact results are of use for comparison purposes against approximate results which exist in the literature. Although many new results are obtained,' the size of the system which can be solved is inherently limited by the technique being used. This is due to the curse of dimensionality.