1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

# There are 5 jobs, each of which is to be processed through three machines A,B and C, in order ABC. Processing time in hours are Job A B C 1 3 4 7 2 8 5 9 3 7 1 5 4 5 2 6 5 4 3 10 Optimal sequence of 5 jobs using Johnson algorithm is

A
1 5 4 3 2
No worries! Weâ€˜ve got your back. Try BYJUâ€˜S free classes today!
B
4 1 5 2 3
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
3 2 1 4 5
No worries! Weâ€˜ve got your back. Try BYJUâ€˜S free classes today!
D
1 2 3 5 4
No worries! Weâ€˜ve got your back. Try BYJUâ€˜S free classes today!
Open in App
Solution

## The correct option is B 4 1 5 2 3Minimum, Ai=3,Max. Bi=5 and mini. Ci=5 Since min.Ci = Max. Bi, we can solve problem by Johnson's algorithm. Job Gi=Ai+Bi Hi=Bi+Ci 1 7 11 2 13 14 3 8 6 4 7 8 5 7 13 Required sequence: 4 1 5 2 3

Suggest Corrections
0
Join BYJU'S Learning Program
Related Videos
Mean and Median of Ungrouped Data
MATHEMATICS
Watch in App
Explore more
Join BYJU'S Learning Program