Exact Method for Solving Single Machine Scheduling Problem Under Fuzzy Due Date to Minimize Multi-Objective Functions

In this paper, the branch and bound technique used to solve a single machine scheduling problem, which is the problem of scheduling n-job on a single machine of multi-objective function with triangle fuzzy due date numbers which are formulated as $1\backslash {\tilde{D}}_{j}=TFN\backslash \displaystyle {\sum }_{j=1}^{n}{C}_{j}+{L}_{\max }$. The target of this paper is to obtained optimal sequence of our problem. The computational results are calculated by using Matlab program and compare the results with the complete enumeration method.