Problem #3: Use Johnson's rule, develop a processing sequence and calculate the minimum makespan for the jobs given in Table 3. Table 3: Details of Processing Times P Q R S IT 5 59 B 110 Job Time on Processor 1 (hours) Time on Processor 2 (hours) At what hour was job Q finished on machine 2? 3 8 5 4 QUESTION 36 Refer to the problem in question 35 At what hour was job T started on machine 2? QUESTION 37 Refer to the problem in question 35 What was the amount of idle time on machine 2 between the completion of job Q and starting of job T? QUESTION 38 Refer to the problem in question 35 At what hour was job T finished on machine 2? QUESTION 39 Refer to the problem in question 35 At what hour was job R started on machine 2? QUESTION 40 Refer to the problem in question 35 What is the total amount of idle time on machine 2? (Hint: You need to look at the complete schedule and identify idle time slots and add them up)