Branch and Bound Technique for three stage Flow Shop Scheduling Problem Including Breakdown Interval and Transportation Time

Abstract

This paper deals with minimization of the total elapsed time for nx3 flow shop scheduling problem in which the effect of breakdown interval and the transportation time are considered. A Branch and Bound technique is given to optimize the objective of minimize the total elapsed time. The algorithm is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule. A numerical illustration is given to clarify the algorithm.

Keywords: Flow shop scheduling, Processing time, Transportation time, Branch and Bound Technique, Optimal sequence.