Modeling for Minimizing Cycle Time in a three-Machine Robotic Cell with ‎Assumption of Tool Switching

In this paper, three-machine scheduling problem in robotic production cells that producing different parts and ‎assuming the tool change has been investigated. The main issue in this article is make decisions about how to move ‎the parts by a robot between machines, the order of parts to robotic production cells as well as how to tool switch on ‎the machine is to achieve the optimum cycle time. A new approach to calculate the number of tool switching is ‎provided. Then a programming model for minimizing cycle time is presented in this problem and the results showed ‎that tool changing and parts sequencing has a direct impact on robot movement policy and cycle time. Finally, ‎numerical examples have been studied using Genetic algorithms. The results were compared with software GAMS. ‎It has been proven that GAMS does not answer for more than eight parts in a reasonable time, but examples up to ‎‎80 different parts using Genetic Algorithm reach to answer in a reasonable time.‎