Sequence the jobs shown below by using a Gantt chart. Assume that the move time between machines is one hour. $($i$.$e$.-$ When a job is complete on it$$s first workstation, it must wait $1$ hour $($move time$)$ before it begins on the next station$)$

Example of Move Time

Machine A $111$

Machine B

$11111$

Sequence the jobs in priority order $1,2,3,4.$ Assume $8$hr work days.

Job Work Center$/$Machine Hours Due Date $($Days$)$

$1$ A$/3,$ B$/2,$ C$/23$

$2$ C$/2,$ A$/42$

$3$ B$/6,$ A$/1,$ C$/34$

$4$ C$/4,$ A$/1,$ B$/23$

a$)$ What is the total makespan?

b$)$ How much machine idle time is there?

c$)$ When is each job delivered compared with its due date?

d$)$ How much idle time $($waiting time$)$ is there for each job?

e$)$ Devise a better job sequence for processing.

$2.$ Problem $4$

In problem $3,$ assume there are two machines of type A$,$ two of type B$,$ and two of type C$.$

a$)$ Prepare a finite capacity schedule

b$)$ How does your FCS compare to the performance of the Gantt chart in problem $2?$