(solution) Consider an m machine flow shop with zero intermediate storages between machines and n jobs. The…

(solution) Consider an m machine flow shop with zero intermediate storages between machines and n jobs. The…

Consider an m machine flow shop with zero intermediate storages between machines and n jobs. The processing times of n−1 jobs on each one of the m machines are 1. Job n has processing time Xin on machine i and the random variables X1n, X2n,…,Xmn are i.i.d. from distribution Fn with mean 1. (a) Show that the sequence that minimizes the expected makespan puts the stochastic job either first or last. (b) Show that the sequence that puts the stochastic job last minimizes the total expected completion time.