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

# There are five jobs, each of which is to be processed through three machines A, B and C in the order CBA. Processing times in hours are:JobABC174329583517462551034What is the optimum sequence for minimizing the elapsed time?

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

## The correct option is C 3-2-5-1-4Minimum of Ai = 5, Maximum of Bi = 5, Maximum of Ci = 3, ∴ Maximum of Bi = Minimum of Ai Hence, we can replace three machines by equivalent two machines and we can use johnson's algorithm. Machine Gi=Ai+Bi Machine Hi=Bi+Ci JobMachine GMachine H1117214133684875137 Now, by Johnson's rule, sequence for minimizing the elapsed time is, 3−2−5−1−4.

Suggest Corrections
2
Join BYJU'S Learning Program
Related Videos
Basics of Percentages
QUANTITATIVE APTITUDE
Watch in App
Explore more
Join BYJU'S Learning Program