Question

QUESTION 5

1. Ricardo Gonzalez is now helping his brother who works at a body and paint shop. The 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	37	21
   B	21	17
   C	14	16
   D	23	30
   E	32	25

   a) What is the optimum sequence of processing (first car to last) by using Johnson’s algorithm for two-stage processing?

   		A D C E B
   		C      D B E A
   		C      D      E      A      B
   		D A E C B

1 points   

QUESTION 6

1. Ricardo Gonzalez is now helping his brother who works at a body and paint shop. The 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	37	21
   B	21	17
   C	14	16
   D	23	30
   E	32	25

   b) Develop the schedule for both Body Work and Paint Shops and determine the idle time and utilization at the Paint Shop.

   Makespan =  

   Total Idle Time =  

   Utilization =  

Answer 1