We show that permutation schedules are always optimal for regular, symmetric measures of performance for the m-machine flow shop with precedence constraints provided that processing times are ...