You are working in a job shop with 3 machines. You have been informed that there are 4 jobs to be completed today. Their routings and times have been provided below. Job Routing and Times 1 (M1,6),(M3,10),(M2,4) 2 (M1,10),(M2,2),(M3,4),(M2,9) 3 (M2,5),(M1,7) 4 (M3,10),(M2,5),(M1,2),(M2,2) All jobs are released at the same time. Create a Gantt chart and calculate the time to completion using the two following rules, and answer the questions related to each of dispatching rules: a. Shortest Processing Time (20 points) a. At time = 0, how many jobs are in the queue for Machine 1. b. At time = 10, which of the machines are busy making parts. C. At what time will job 1 finish. d. At what time will job 2 finish. e. What is the completion time for all jobs. b. Longest Processing Time (20 points) a. At time = 0, how many jobs are in the queue for Machine 2. b. At time = 10, which of the machines are busy making parts. c. At what time will job 1 finish. d. At what time will job 2 finish. e. What is the completion time for all jobs.
