We will use johnsons two machine scheduling for this problem. We will take the s
ID: 373381 • Letter: W
Question
We will use johnsons two machine scheduling for this problem.
We will take the shoretest time and if it belongs to first machine, then we will schedule that first. If it belongs to second machine, we will put it at last.
Shortest time is 1 hr for car E and it belongs to first process. So it will be optimised first. (E-)
Second shortest time is 2 hr for A. It belongs to second process. So we will put it last (E- - - -A)
Third shortest time is 3 hr for D and belongs to first process. So the postion will be as E-D---A
Fourth Shortest time is 4 hr for B and belongs to second process. The positioning will be E-D- -B-A
Only slot available can be used by C. The sequence will be E-D-C-B-A
The total time for Body works will be 26 hrs. The total time for painting ( 1hr wait- 7 hrs E- 6 hrs D-5hrs C-4 hrs B- 3 hrs wait- 2hrs A) which will be through put 28 hrs
a. From above data, the option for this MCQ is First
b. The answer to second MCQ is 28 hrs
b. The throughpoint time will be
Explanation / Answer
3. The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the time needed to compete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body and paint work on each car are as follows:
BODY WORK PAINT
CAR (hours) (hours)
=== ========= =======
A 9 3
B 4 5
C 8 5
D 5 2
E 1 6
If the cars are processed in alphabetical order, how long will it require to complete all five cars?
Can you find a sequence that improves upon the makespan of a)?
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.