3:34DoneChapter 16 Assessment i24SkippedeBookReferencesMcGrawHill<ezto.mheducation.com AACarABсDEThe operations manager of a body and paint shop has fivecars to schedule for repair. He would like to minimize themakespan to complete all work on these cars. Each carrequires body work prior to painting. The estimates of thetimes required to do the body and paint work on each areas follows:Body Work(hrs)1057O3Multiple ChoiceO1OWhat is the optimum sequence (first car to last)?A; B; C; D; EE; D; C; B; AE; B; D; C; AE;D; B; C; AOE;SavedPaint(hrs)24567E; B; D; A; C< PrevHelp Save & Exit Submit24 of 25Next >P

Johnson's rule is a heuristic method for scheduling jobs on two machines in order to minimize the makespan, or the total time to complete all jobs. It is a simple and effective rule, and it is often used in manufacturing and other industries.Johnson's rule works as follows:Arrange all the tasks and the duration of each machine's processing.The task with the least processing time should be picked.Schedule the task first if it takes the least amount of time to process on the machine 1.Schedule the task last if it takes the least amount of time to process on the machine 2.Remove the task for further consideration and repeat steps until all jobs are scheduled. CarBody WorkPaintA102B54C75D36E17Here, we consider Machine 1 = Bodywork and Machine 2 = PaintStep 1:We can see that the least processing time is 1 hour for Car E at machine 1.Thus, it needs to be scheduled first then eliminate Car E for further consideration.Step 2:Here, the next lowest processing time is 2 hours for Car A at machine 2.Thus, it needs to be scheduled last then eliminate Car A for further consideration.Now, in our sequence, the first car is E and the last one is AStep 3:Here, the next lowest processing time is 3 hours for Car D at machine 1.Thus, it needs to be scheduled first (after E) then eliminate Car D for further consideration.Step 4:Here, the next lowest processing time is 4 hours for Car B at machine 2.Thus, it needs to be scheduled last (before A) then eliminate Car B for further consideration.Step 5:Here, the next lowest processing time is 5 hours for Car C at machine 2.Thus, it needs to be scheduled last (before B) then eliminate Car C for further consideration.Now all cars are scheduled.The optimal sequence using Johnson's rule is E-D-C-B-ATherefore-the optimum sequence using Johnson's rule is E-D-C-B-AThe correct option is (b) E; D; C; B; A