#1) 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. (7 points)
If jobs were processed in the sequence: A-B-C-D-E, when will job 'B' be completed? (3 points)
|
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
|
#2) The following table contains information regarding jobs that are to be scheduled through one machine:
|
OPERATIONS TIME
|
|
JOB
|
PROCESSING TIME(DAYS)
|
DUE DATE
|
|
A
|
4
|
10
|
|
B
|
12
|
20
|
|
C
|
2
|
30
|
|
D
|
11
|
18
|
|
E
|
10
|
10
|
What is the shortest operating time (SOT) schedule?
What is the slack time remaining (STR) schedule?
For the schedule A-B-C-D-E, compute average lateness?