Abstract In order to find the optimal configuration of an automated flow line it is necessary to compare the performance of several alternative configurations. In this situation the use of simulation is normally not viable given the high modelling and computational effort it would require; on the other hand, the application of classical analytical tools would often entail the adoption of unrealistic assumptions. To solve this problem, the paper presents an approximate analytical method that overcomes many of the limitations of analytical tools while preserving good accuracy and low computational effort. In particular the method can deal with deterministic processing times, finite buffer capacity and multiple failure modes of the machines. This last feature represents an important improvement over existing techniques and is very useful when dealing with automated assembly lines where each station is composed by different devices that have different reliability and different ways to get repaired. The validation of the method has been carried out by means of extensive testing and comparison with simulation. An application to a real case is also reported.
[1]
Oded Berman,et al.
Analysis of transfer lines consisting of two unreliable machines with random processing times and finite storage buffers
,
1981
.
[2]
E. Lenz,et al.
RALB – A Heuristic Algorithm for Design and Balancing of Robotic Assembly Lines
,
1993
.
[3]
Stanley B. Gershwin,et al.
Manufacturing Systems Engineering
,
1993
.
[4]
Stanley B. Gershwin,et al.
An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
,
1987,
Oper. Res..
[5]
Yves Dallery,et al.
An efficient algorithm for analysis of transfer lines with unreliable machines and finite buffers
,
1988
.
[6]
Yves Dallery,et al.
Manufacturing flow line systems: a review of models and analytical results
,
1992,
Queueing Syst. Theory Appl..