Esnek robotik hücrelerde çoklu parça tipi çizelgelemesi

This thesis considers the scheduling problem arising in two-machine manufacturing cells which repeatedly produce a set of multiple part-types, and where transportation of the parts between the machines is performed by a robot. the cycle time of the cell depends on the robot move sequence as well as the processing times of the parts on the machines. for highly flexible cnc machines, the processing times can be adjusted. as a result, this study tries to find the robot move sequence as well the processing times of the parts on each machine that minimize the cycle time. the problem of determining the best cycle in a 2-machine cell is first modeled as a travelling salesman problem. then an efficient 2-stage heuristic algorithm is constructed and compared with the most common heuristic approach of longest processing time.