We consider the scheduling problems F2∥Cmax and F2|no-wait|Cmax, i.e. makespan minimization in a two-machine flow shop, with and without no wait in process. For both problems solution algorithms based on sorting with O(n log n) running time are known, where n denotes the number of jobs. We prove that no asymptotically faster algorithms can solve these problems. This is done by establishing Ω(n log n) lower bounds in the algebraic computation tree model of computation. Moreover, we develop for every ϵ > 0 approximation algorithms with linear running time 0(n log(1/ϵ)) that deliver feasible schedules whose makespan is at most 1 + ϵ times the optimum makespan.
