SCM $265$ NIEDERHOFF

Chapter $9$ part $2$

A body and paint shop has five cars to schedule for repair. They would like to minimize throughput time

to complete all work on these cars. Each car requires body work prior to painting. The estimates of the

time required to do the body and paint work on each area are as follows:

CAR BODY WORK $($hours$)$ PAINT $($hours$)$

A $3721$

B $1416$

C $2117$

D $2330$

E $3225$

Notice that this is $127$ hours of work for the body shop and $109$ hours for the paint work. We$$re

assuming this schedule happens over a $3-4$ week period and jobs will carry over from day to day with no

effect on the time it takes to complete the job if it is stopped mid$-$way and started up again the next

morning. In other words, treat the $100+$ hours as a single continuous shift.

$($A$)$ What is the suggested sequence of processing $($first car to last$)$ by using Johnson$$s Rule for twostage processing?

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

$($B$)$ What is the idle time in the paint department as a number of hours and as percentage of workday? $($include the time spent waiting for the first job to come to paint and ending at the time

period when the last car leaves the paint department