Problem 1: Consider the following data on jobs waiting to be scheduled on two machines in serial.
Job Proc. Time Proc. Time
Machine 1 Machine 2
A 5 8
B 3 9
C 8 7
D 7 2
E 4 6
Using Johnson’s Rule to sequence the jobs, what would be the correct sequence for processing the jobs?
Problem 2: Consider the following data on jobs waiting to be scheduled on two machines in serial.
Job Proc. Time Proc. Time
Machine 1 Machine 2
A 5 2
B 9 3
C 8 7
D 5 4
E 9 6
These jobs are sequenced by a scheduler in the following order: C E D B A. What will be the total flowtime (or makespan) for all of the jobs to be processed on both machines (from start of first job on first machine until completion of last job on second machine)?
Please show your work.