|
چکیده
|
This paper recognizes thirty-six, potentially optimal robot movement policies, to schedule the movements of a robot in a three-machine exible cell. The robotic cell produces multi-type parts, in which the robot is used as a material handling system. In this manufacturing cell, the machines have operational exibility and can be set up for di erent operations; all parts have three operations. Finding the robot movement policy and sequence of parts to minimize the cycle time (i.e., maximize the throughput) is the aim of this work. It was proved that cycle time calculation, in twelve out of thirty-six policies, are unary NP-complete, and a polynomial time algorithm is introduced that can solve the twentyfour left policies. This paper develops the cycle times of all these thirty six robot movements policies, considering waiting times in a exible three-machine robotic cell with multi-type parts, and introduces a parts sequence under a special condition, in which one of the policies minimizes the cycle time (i.e., maximize throughput). This kind of exibility di ers from other research into robotic cells, wherein a machine can process di erent operations. Moreover, we consider cells with multiple part types, which is more realistic than other developed models. Finally, a new mathematical model, based on Petri-nets, was provided for one of the robot movement policies. Furthermore, this mathematical model is also developed for the multi-type part problem.
|