SAI method for solving job shop sequencing problem under certain and uncertain environment

In this investigation, we use SAI method (Gupta et al. 2016), for solving sequencing problem when processing time of the machine is certain or uncertain in nature. The procedure adopted for solving the sequencing problems is easiest and involves the minimum numbers of iterations to obtain the sequence of jobs. The uncertainty in data is represented by triangular or trapezoidal fuzzy numbers. Yager’s ranking function approach is used to convert these fuzzy numbers into a crisp at a prescribed value of α. Stepwise SAI method is then used to obtain optimal job sequence for the problem. Further, the result obtained by SAI method is compared with Johnson’s Method. Numerical examples are given to demonstrate the effectiveness of the proposed approach.