Some Numerical Experiments for anM×JFlow Shop and its Decision-Theoretical Aspects

Abstract

Numerical experiments for M × J deterministic flow shops performed on an IBM 704 digital computer lead to the conclusion that the schedule times are approximately normally distributed for large numbers of jobs. The meaning of this result in the decision-theoretical problem of sampling for a minimum is discussed. Examples of these results for 10 × 100 and 10 × 20 schedules are given.