FLOW SHOP SCHEDULING PROBLEMS USING BRANCH AND BOUNDTECHNIQUE UNDERLR-FUZZY NUMBER

Abstract

This paper is an analysis of flow shop scheduling problem in LR-fuzzy numbers where processing time of the jobs are associated with probabilities and solved using Branch and Bound technique to obtain the optimal sequence. Here processing time of the jobs are represented by LR fuzzy numbers. Using under various reference function in the Yager’sranking formula the total duration of the jobs were calculated. A numerical example is illustrated to obtain the completion time of the jobs by using the Branch and Bound technique in LR -fuzzy numbers with various reference functions.