2. question please thank you

1. (60 points) Consider the 11 Le problem with 4 jobs. Let 2.1 and represent the release times of the jobs, respectively. Select a different integer release date for andra from the interval (6. 8and a different integer release date for andre from the interval [0, 37. The processing times of jobs are represented by pr. pap and respectively. Select a different integer processing time for p and p from the interval (4, 10) and a different integer processing time for p and pe from the interval [1, 5). The due dates of jobs are represented by di dadsand ils, respectively. Select a different integer due date for each job from the interval [5.20). Solve the problem and find the optimal job sequences) using branch & bound method. Draw the branch & bound tree properly. Show cach iteration and step very explicitly. Draw the Gantt chart of each step. For each node: compute the lower bound (LB) and indicate the preemptive non-preemptive status of the corresponding schedule. When you disregard (eliminate) a node, explain how why you climinate that node and put a cross sign on the branch & bound tree. Before solving the question, fill in the following table and copy it into your answer sheet: Jobi Job 2 Job 3 Job ni 3 3 ra PI P P pu d! 2. (40 points) Consider the following problem as an instance of the chain! EwA 12.5ob single machine data with job precedence constraints graph is given below: 10 Suppose that the scheduler does not have to complete all the jobs in a chain consecutively, but has to preserve the precedence relations Select a different inlegat processing time p, for cach job from the interval [10, 30) and a different integer weight for each job) from the interval [1. 12. Beforc solving the question fill in the following table and copy it into your answer sheet: Job; 2 3 4 5 7 9 10 11 1 8 12 P Ny Find the optimal sequence to minimize total weighted completion times. Compute the optimal value of the objective function. Show your solution step by step explicitly 1. (60 points) Consider the 11 Le problem with 4 jobs. Let 2.1 and represent the release times of the jobs, respectively. Select a different integer release date for andra from the interval (6. 8and a different integer release date for andre from the interval [0, 37. The processing times of jobs are represented by pr. pap and respectively. Select a different integer processing time for p and p from the interval (4, 10) and a different integer processing time for p and pe from the interval [1, 5). The due dates of jobs are represented by di dadsand ils, respectively. Select a different integer due date for each job from the interval [5.20). Solve the problem and find the optimal job sequences) using branch & bound method. Draw the branch & bound tree properly. Show cach iteration and step very explicitly. Draw the Gantt chart of each step. For each node: compute the lower bound (LB) and indicate the preemptive non-preemptive status of the corresponding schedule. When you disregard (eliminate) a node, explain how why you climinate that node and put a cross sign on the branch & bound tree. Before solving the question, fill in the following table and copy it into your answer sheet: Jobi Job 2 Job 3 Job ni 3 3 ra PI P P pu d! 2. (40 points) Consider the following problem as an instance of the chain! EwA 12.5ob single machine data with job precedence constraints graph is given below: 10 Suppose that the scheduler does not have to complete all the jobs in a chain consecutively, but has to preserve the precedence relations Select a different inlegat processing time p, for cach job from the interval [10, 30) and a different integer weight for each job) from the interval [1. 12. Beforc solving the question fill in the following table and copy it into your answer sheet: Job; 2 3 4 5 7 9 10 11 1 8 12 P Ny Find the optimal sequence to minimize total weighted completion times. Compute the optimal value of the objective function. Show your solution step by step explicitly