Application of Branch and Bound Method for Optimal Two Stage Flow Shop Scheduling Problem with Group Job-Restrictions

Abstract

This paper studies two stage flow shop scheduling problem in which equivalent job for group job, processing times on each machine 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.

Keywords: Equivalent job, processing time, elapsed time, Branch and Bound