Sequence the jobs shown by using a Gantt chart. Assume that the move time between machines is one hour. Also, assume there are two machines of type A, two of type B, and two of type C. Sequence the jobs in priority order 1, 2, 3, 4. Due Date (days) Job 1 2 3 4 Work Center/Machine Hours A/3, B/2, 0/2 C/2, A/4 B/6, A/1, C/3 C/4, A/1, B/2 4 3 Prepare a finite capacity schedule. a. What is the makespan? Makespan hours b. How much machine idle time is there? Work Center Idle Time (hours) A B TOTAL c. When is each job delivered compared with its due date? Job Due Date (hours) Delivery Time (hours) 1 2 3 4 d. How much idle time (waiting time) is there for each job? Job Idle Time (hours) 1 2 3 4 TOTAL