Admissions Open
Admissions Open
Abstract: This paper deals with n-job, three machines flow shop scheduling problem with three parallel machines for the first machine. The unit rental cost of all the machines is given. The processing time of the jobs on all machines are given along with their respective probabilities. Here objective is to find the optimal sequence of jobs and allocation of machines to jobs in order to minimize the total elapsed time of jobs. The concept is made clear with the help of numerical example.