An analysis of pure robotic cycles

This thesis is focused on scheduling problems in robotic cells consisting of a number of CNC machines producing identical parts. We consider two different cell layouts which are in-line robotic cells and robot centered cells. The problem is to find the robot move sequence and processing times on machines minimizing the total manufacturing cost and cycle time simultaneously. The automation in manufacturing industry increased the flexibility, however it is not widely studied in the literature. The flexibility of machines enables us to process all the required operations for a part on the same machine. Furthermore, the processing times on CNC machines can be increased or decreased by changing the feed rate and cutting speed. Hence, we assume that a part is processed on one of the machines and the processing times are assumed to be controllable. The flexibility of machines results in a new class of cycles named pure cycles. We determined efficient pure cycles and corresponding processing times dominating the rest of pure cycles in the specified cycle time regions. In addition, for in-line robotic cells, the optimum number of machines is determined for given parameters.