Scheduling of two and three machine robotic cells with fuzzy methodology

Abstract

This paper addresses the scheduling of robotic cells with two and three machines with fuzzy methodology. Some of the scheduling problems of these categories are transferred into a solvable traveling salesman problem that can be solved in a polynomial time. For generating the optimal part sequencing in the cells, the Gilmore and Gomory algorithm is modified and instead, a fuzzy Gilmore and Gomory algorithm is developed. Then, the proposed algorithm is tested and verified in a supplier company that produces part for an automobile industry. In any case, we compare the results of the proposed fuzzy method with those of crisp ones. The results show the superiority of the proposed algorithm in terms of flexibility, robustness, and reduction of cycle times.

Keywords:

• fuzzy scheduling
• fuzzy robotic cells
• fuzzy cycle time
• fuzzy numbers
• fuzzy traveling salesman problem