Optimization of Fuzzy Sequencing Problems with Heptagonal Fuzzy Numbers

Abstract

Consider the situation of planning 5 occupations to 4 machines, the handling time as Heptagonal fuzzy nos. The fuzzy sequencing numbers is modified into crisp value by utilizing ‘Python’ program. Consequently the ideal succession of the positions is found by using Johnson’s Bellman‘s Algorithm, in which total elapsed time and idle time for each machine is obtained.