Admissions Open
Admissions Open
In this paper, we study specially structured nx2 Flow Shop Scheduling model where the probabilities are considered with processing times of the machines. The time consumed in transportation of a job from machine-1 to machine-2 is also taken into account. The intention of the findings is to get optimal sequence of jobs in order to optimize the total waiting time of the jobs through iterative algorithm. The algorithm is also applied to a numerical example.