Theorem 2 — if $\min A_i \ge \max B_j$, Johnson's rule on $A+B$, $B+C$ gives an optimal three-stage schedule

Initializing...

Theorem 2 — if $\min A_i \ge \max B_j$, Johnson's rule on $A+B$, $B+C$ gives an optimal three-stage schedule · Prove2Me