In this paper we analyze the efficiency of a given robot movement schedule for the case of a flowshop robotic production cell with m different machines, one input conveyor, and one output conveyor. We begin with the case of one-robot cells and extend our results to multi-robot cells. The paper studies the efficiency of a movement schedule for identical parts by defining a movement network associated with this schedule. This network models any cell layout and applies to multi-robot cells. Using the movement network, we propose two cycle time evaluation methods, the first using linear programming and the second based on finding a longest path. The latter method generates a procedure to obtain an analytical formula for the cycle time. We extend the proposed methods to study the efficiency of a given input sequence (schedule) for different parts, that is, to determine the sequence processing time. The results obtained here allow us to quickly evaluate the efficiency of any given feasible movement schedule, for identical or different parts.
Paru en février 1993 , 27 pages
Ce cahier a été révisé en avril 1994