View article

The optimization problem of minimizing the completion time in permutation flow shop scheduling is considered under the assumption that the processing times of a job on different machines are independent and identically distributed random variables. Models with and without intermediate storage are considered. Solutions for special cases are found and based on these results a more general rule of thumb is obtained.