1) Jobs A, B, C, D and E must go through Processes I and II in that sequence (Process I first, then Process II). PLEASE SHOW WORK SO I KNOW HOW TO DO IT.
a) Use Johnson's rule to determine the optimal sequence in which to schedule the jobs to minimize the total required time.
b) If jobs were processed in the sequence: A-B-C-D-E, when will job 'B' be completed?
|
JOB
|
Required Processing Time on Process (Machine) I (in hours)
|
Required Processing Time on Process (Machine) II (in hours)
|
|
A
|
4
|
5
|
|
B
|
16
|
14
|
|
C
|
9
|
6
|
|
D
|
10
|
8
|
|
E
|
2
|
6
|