Абстрактный

Optimal Two Stage Flow Shop Scheduling Problem with Branch and Bound Method Including Transportation Time

Deepak Gupta Payal Singla Shashi Bala

This paper studies two stage flow shop scheduling problem in which processing times are associated with their respective probabilities and transportation times from one machine to another are given. The objective of the study is to get optimal sequence of jobs in order to minimize the total elapsed time. The given problem is solved with branch and bound method. The method is illustrated by numerical example.