A Pentagonal Fuzzy Number in Solving Fuzzy Sequencing Problem

Abstract

In this paper, we proposed a solution procedure to solve fuzzy job sequencing problem, where processing time being taken as pentagonal fuzzy numbers. The optimal solution of the job and idle time for each machine is obtained by solving corresponding crisp sequencing problems. The procedure adopted was the fuzzy sequencing problems that are defuzzified using Pascal's triangular graded mean for pentagonal fuzzy ranking index method. The fuzzy sequencing problem has been transformed in to crisp one, using linguistic variable and solved by Johnson's Algorithm. The linguistic variable helps to convert qualitative data in to quantitative data which will be effective in dealing with fuzzy sequencing problems at qualitative nature.