Abstract: The job sequencing problem is an important branch of operations research where the order of processing jobs affects system performance. Due to vagueness and uncertainty in crisp theory sequencing problems are taken in which processing times are taken as fuzzy numbers. In this paper processing times are taken as trapezoidal fuzzy numbers and a new ranking function is proposed for determination of the optimal sequence of jobs, aiming to minimize the total elapsed time. Numerical example is given for demonstrating the proposed ranking function.

Keywords: Sequencing problem, trapezoidal fuzzy numbers, ranking function, optimal sequence, total elapsed time.

Downloads: | DOI: 10.17148/IARJSET.2024.111030