The authors consider M machines in tandem with an infinite supply of jobs and no intermediate storage, and look for the order of the machines which will maximize the throughput. They show that if processing times on the machines are comparable in the sense of likelihood ratio, then it is optimal to use slower machines in the first and last position than in the second and penultimate positions. For 3 and 4 machines this implies shape order of the machines.
