Sequencing Problem with Processing Time as Decagonal Fuzzy Numbers

Abstract: In this paper, a new method to solve Job Sequencing problem with Decagonal Fuzzy Numbers is given. Job sequencing technique is used to find optimal sequence in order to minimize the total elapsed time of the sequence. In this paper ranking method of decagonal fuzzy numbers based on area is given. To find out area given region is divided into nine triangles then centroids are calculated for each triangle. From centroids of triangles centroid of centroids and incentre of centroids is calculated from which ranking function is derived for doing ranking of decagonal fuzzy numbers. Numerical example is given to clarify the concept. Finally, the conclusion is given.