Key points are not available for this paper at this time.
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.
Jack Heller (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: