1
Question
There are eight jobs each of which is to be processed through two machines A and B in the order AB. Processing times in hours are given in table:
What is the optimum sequence for minimizing the total elapsed time?
There are eight jobs each of which is to be processed through two machines A and B in the order AB. Processing times in hours are given in table:
What is the optimum sequence for minimizing the total elapsed time?
Open in App
Solution
The correct option is B 6−4−7−8−2−1−3−5
Using Johnson's algorithm
If minimum time is for machine B, schedule it at last and if minimum time i for machine A schedule it first,
So optimum sequence is
6−4−7−8−2−1−3−5
To minimize elapsed time jobs should be processed in order of,
6−4−7−8−2−1−3−5
Using Johnson's algorithm
If minimum time is for machine B, schedule it at last and if minimum time i for machine A schedule it first,
So optimum sequence is
6−4−7−8−2−1−3−5
To minimize elapsed time jobs should be processed in order of,
6−4−7−8−2−1−3−5
Suggest Corrections
3
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
