Admissions Open
Admissions Open
Abstract:-A flow shop scheduling problem is one of the classical problems in production scheduling. In this paper, we study specially structured Flow Shop Scheduling Model where in transportation time from one machine to another machine is taken into account. It is assumed that maximum of the processing time on first machine is less than or equal to the minimum of processing time on second machine. The purpose of the study is to get optimal sequence of jobs in order to optimize the total waiting time of the jobs through iterative algorithm. The algorithm is made clear by numerical example.