Please only do problem 2. However, it relies on Question 1.

QUESTION 1 Data for a Job Shop Scheduling problem with n = 4 jobs and m = 4 machines are given below. All questions in this assignment will be based on these data. Machine Sequence Processing Times (Routing of the job) Job 1 1,2,3,4 1,3,5.4 Job 2 2, 4,1 6, 2,4 4.3.2 5, 1, 2 Job 4 3.2.1 3, 4, 1 Job 3 Use the LWKR (Least Work Remaining) rule in the first set of questions until you are asked to switch to another rule. Using the LWKR rule, which of the following statements are correct regarding the job-machine assignments at time 0? Job 1 starts on Machine 1 and all other jobs wait in the queue of Machine 1. Each machine has only one job waiting for it at time 0, so each job can start right ahead with its first operation. Either Job 3 or Job 4 starts on Machine 1 and all other jobs wait in the queue of Machine 1 O Machine cannot start processing any job until all jobs arrive into its queue. QUESTION 2 Continue with the LWKR rule. At time 6, you should see that Job 2 completes on Machine 2 and all other jobs are in Machine 2's queue, so it must select one of the jobs to process next. Fill in the arrival times and remaining works (total processing time all remaining operations of the job) of the three jobs in the following table: Job Arrival time at Machine 2 queue Work Remaining 1 3 4