Johnson's algorithm (JA) is perhaps the most classical algorithm in the scheduling area. JA gives the optimal solution to the two machine flow shop to minimize the makespan in polynomial time. Researchers have tried to extend this notorious result to obtain polynomial time algorithms for more...