In this paper, we develop a new mathematical model for a cyclic multiple-part type three-machine robotic cell problem with assumption of robot movement policy that minimizes the cycle time. The developed model is based on Petri nets and provides a new method to calculate cycle times by considering waiting times. It was proved that calculating cycle time under policy is unary NP-complete. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. In this paper we implement the genetic algorithm (GA) to solve the problem. To validate the developed model and solution algorithm, various test problems are examined.
