Admissions Open
Admissions Open
The present paper studies job block concept in specially structured two stage flow shop scheduling in which processing times are associated with respective probabilities. It is assumed that the maximum of expected times on first machine is less than or equal to the minimum of expected times on second machine. The objective of the study is to get optimal sequence of jobs in order to minimize the total waiting time of the jobs by taking two of the jobs as a group job through iterative algorithm. The algorithm is made clear by numerical example.