An efficient algorithm for analysis of transfer lines with unreliable machines and finite buffers

In a recent paper, Gershwin proposed a decomposition method for the approximate analysis of transfer lines with unreliable machines and finite buffers. The method is based on a decomposition of the line into a set of two-machine lines. It leads to a set of equations which are solved using an iterative algorithm. Experimental results have shown that this technique is very accurate. However, it may happen that the algorithm fails to converge. In this paper, the authors propose to replace the original set of equations by an equivalent one, which is again solved using an iterative procedure. This new algorithm is simpler than the previous one, and its computational complexity is lower. Moreover, on all examples the authors tested, the algorithm always converged.