Solving Octagonal Fuzzy Sequencing Problem using New Ranking Method

Abstract

In this paper, a new method is proposed for solving octagonal fuzzy sequencing problem using new ranking method (taking k = 0.5) for converting crisp problem for finding Job sequence of two machine n jobs. The optimality for the completion of the task and idle time for each machine is obtained by solving corresponding sequencing problem using Johnsons’s rule. It is illustrated with a numerical example.