Jobs A$,$ B$,$ C$,$ D$,$ and E must go through Processes I and II in that

sequence $($Process I first, then Process II$).$ Use Johnson$$s rule to

determine the optimal sequence in which to schedule the jobs to

minimize the total required time.

Job

Required

Processing

Time on I

Required

Processing

Time on II

A $45$

B $1614$

C $87$

D $1211$

E $39$