Application of Branch and Bound Technique for n 3 Flow Shop Scheduling, In Which Processing Time Associated With Their Respective Probabilities

Abstract

The paper deals branch and bound technique to solve a 3 stage flow-shop scheduling problem in which probabilities are associated with their processing time. Our objective is to obtain an optimal sequence of jobs to minimizing the total elapsed time. The working of the algorithm has been illustrated by numerical example.

Keywords: Flow-Shop, Branch and Bound, Scheduling, Make Span, Total Elapsed Time.