SCHEDULING IN A THREE-MACHINE FLEXIBLE ROBOTIC CELL

In this study, a three-machine flexible robotic manufacturing cell in which the CNC machines are used is considered. These machines are highly flexible and are capable of performing several different operations. Each machine is assumed to be capable of performing all of the required operations of each part. As a consequence of this assumption, a new class of cycles is defined and three simple and widely used cycles among this class is proposed. The regions of optimality for these cycles as well as the worst case performances are derived.