This paper analyzes the productivity of a robotic production cell, functioning under a repetitive robot movement cycle. For a general m machine cell we show that the problem of cycle time evaluation is in fact an instance of the basic cyclic scheduling model. Thus, several powerful results previously developed in the cyclic scheduling context are used to analyze our problem. We propose a detailed longest path based polynomial algorithm to solve the problem of cycle time evaluation in a robotic cell. The proposed algorithm provides the exact value of the cycle time for any cell data, since it does not use a bisection search to find the solution. The results are first introduced for one-robot cells and then extended to multi-robot cells.
Paru en avril 1994 , 28 pages
Ce cahier a été révisé en juillet 1996