Optimal Scheduling of N Job and N Machine by Branch and Bound Method:A Case Study Approach

This paper deals with minimization of the total elapsed time for nx3 flow shop scheduling problem. A Branch and Bound technique is given to optimize the objective. The algorithm defined in this paper is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule. Our aim is to obtained optimal sequence of jobs and to minimize the total tardiness. The working of the algorithm has been illustrated by case study.