5. (a) $ b) There are seven jobs, cach of which has to go through the machines A and B in order AB Prossing time in hours are given as: Jobs 1 2 3 5 6 7 Machine A 3 12 13 6 10 11 9 Machine B 8 10 10 6 12 1 1 Determine a sequence of these jobs that will minimize the Total Elapsed Time T We have seven jobs each of which must go through the machine M, M, and M, in der M.M.My. Processing Time in hours) is us follows: Jobs A B C. F G Machine M, 3 7 4 9 7 Machine M 0 3 2 5 3 7 5 5 Machine M 12 Find the sequence that minimize the Total Elapsed Time Discuss Graphical Method for processing of 2 jobs through a machines. 8 w 1 4 6 (c)
Answers
Answer: The total clopased time for this sequence is 77 hours.
Step-by-step explanation
Job sequence Machine M1 Machine M2
Time Time Time Time
In Out In Out
A 0 3 3 11
D 3 9 11 17
E 9 19 19 31
B 19 31 31 41
C 31 46 46 56
G 46 65 65 68
F 65 76 76 77
T= 77hours
Idle time for machine M1=77−76=1hours
Idle time for machine M2=3+2+5+9+8=27
Spented Hard To Type Like This Mark As Brainlist You Found Helpful