Main Article Content
Discuss the situation of planning n occupations to 2 machines, the handling time as trapezoidal fuzzy nos. The fuzzy sequencing issue is changed over into crísp value by utilizing Python’s program. Consequently the ideal succession of the positions is found by using Johnson’s calculation, in which total elapsed time and inactive time for each machine is obtained. An illustrative mathematical model is given to show the execution of the fuzzy sequencing problems.