Exact Solution to Solve Multi-Objective Functions In Fuzzy Flow Shop Scheduling Problem

This paper deals with branch-and-bound algorithms to solve the flow shop scheduling problem to obtain a minimized multi-objective function under a fuzzy environment. Where the processing time is a triangular fuzzy number, the objective of this paper is to obtain an optimal sequence to fuzzy-minimize total weighted tardiness time, so we used three upper bounds and two lower bounds in a branch-and-bound algorithm on two machines. And also compared the branch-and-bound and complete enumeration methods, and compared results with the complete enumeration method in terms of processing time in a MATLAB program and the number of nodes.