Stochastic minimization of the makespan in flow shops with identical machines and buffers of arbitrary size

Stochastic permutation flow shops of m identical machines and n jobs are considered. There exist buffers of arbitrary size between two consecutive machines. For particular types of job processing times, the authors present optimal schedules which minimize the makespan in the stochastic sense. Moreover, it will be shown that the optimal schedules are closely related to those of the no buffer case. Finally the present results are recaptured in the context of tandem queues.