Approximate analysis of transfer lines with unreliable machines and finite buffers

Abstract

The authors present an approximate method for the analysis of transfer lines with unreliable machines and finite buffers. In these systems blocking and starvation, which occur as a consequence of machine failures, are important phenomena. They first consider homogeneous lines, i.e., lines for which all machines have the same processing times. The behavior of the line is approximated by a continuous flow model. They then use a decomposition technique which enables one to decompose the analysis of the line into the analysis of a set of two-machine lines. This leads to a simple and fast algorithm which provides performance parameters such as production rate and average buffer levels. Experimental results show that this approximate technique is very accurate. They then consider the case of transfer lines with machines having different processing times. A simple transformation is introduced which replaces the line by a homogeneous line. This approximate transformation provides good results for a large class of systems.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>