One’s Fixing Method for a Distinct Symmetric Fuzzy Assignment Model

Abstract

This paper hinges upon the subject of an (n × n) assignment problem and the distinct symmetric fuzzy assignment problem byassigning n machines to n jobs. One’s orientation algorithm is developed for solving the assignment problems based on the position of one’s chosen in every row as well as every column to perform allocations and obtain the assignment cost at every (n − 1) reduced matrix. We also extended the two different symmetric concept to the problem to find the optimum solution based on symmetrical data and also used the ranking concept in our fuzzy assignment problem. In this proposed algorithm, the one’s position is associated with the successor of one in each iteration toobtain the optimal schedule and assignment cost. The comparative analysis is properly considered and discussed. The proposed technique is elaborated with the help of numerical computations and it gives clarity to the idea of this concept.

Keywords

• symmetric triangular fuzzy number
• symmetric trapezoidal fuzzy number
• fuzzy assignment problem