Johnson's rule gives the sequence of jobs with the optimal makespan for flow shop scheduling problem with machines and jobs.

(a) 1, n

(b) 2, n

(c) 4, n

(d) None of the above AppendixLO1