1 1 1. (60 points) Consider the 1L max problem with 4 jobs. Letr, 12. ; and rrepresent the release times of the jobs, respectively. Select a different integer release date for ri and r2 from the interval [6, 8) and a different integer release date for r; and from the interval (0, 3). The processing times of jobs are represented by p, P2, P3, and p4, 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 d, da, dj and ds, respectively. Select a different integer due date for each job from the interval [5, 20). Solve the problem and find the optimal job sequence(s) using branch & bound method. Draw the branch & bound tree properly. Show each iteration and step very explicitly. Draw the Gantt chart of each step. For each node: compute the lower bound (LB) and indicate the preemptiveon-preemptive status of the corresponding schedule. When you disregard (eliminate) a node, explain how/why you eliminate 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: Job 1 Job 2 Job 3 Job 4 12 14 PI P2 p3 P4 di dz d3 de 1 1 1. (60 points) Consider the 1L max problem with 4 jobs. Letr, 12. ; and rrepresent the release times of the jobs, respectively. Select a different integer release date for ri and r2 from the interval [6, 8) and a different integer release date for r; and from the interval (0, 3). The processing times of jobs are represented by p, P2, P3, and p4, 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 d, da, dj and ds, respectively. Select a different integer due date for each job from the interval [5, 20). Solve the problem and find the optimal job sequence(s) using branch & bound method. Draw the branch & bound tree properly. Show each iteration and step very explicitly. Draw the Gantt chart of each step. For each node: compute the lower bound (LB) and indicate the preemptiveon-preemptive status of the corresponding schedule. When you disregard (eliminate) a node, explain how/why you eliminate 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: Job 1 Job 2 Job 3 Job 4 12 14 PI P2 p3 P4 di dz d3 de 1 1 1. (60 points) Consider the 1L max problem with 4 jobs. Letr, 12. ; and rrepresent the release times of the jobs, respectively. Select a different integer release date for ri and r2 from the interval [6, 8) and a different integer release date for r; and from the interval (0, 3). The processing times of jobs are represented by p, P2, P3, and p4, 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 d, da, dj and ds, respectively. Select a different integer due date for each job from the interval [5, 20). Solve the problem and find the optimal job sequence(s) using branch & bound method. Draw the branch & bound tree properly. Show each iteration and step very explicitly. Draw the Gantt chart of each step. For each node: compute the lower bound (LB) and indicate the preemptiveon-preemptive status of the corresponding schedule. When you disregard (eliminate) a node, explain how/why you eliminate 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: Job 1 Job 2 Job 3 Job 4 12 14 PI P2 p3 P4 di dz d3 de 1 1 1. (60 points) Consider the 1L max problem with 4 jobs. Letr, 12. ; and rrepresent the release times of the jobs, respectively. Select a different integer release date for ri and r2 from the interval [6, 8) and a different integer release date for r; and from the interval (0, 3). The processing times of jobs are represented by p, P2, P3, and p4, 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 d, da, dj and ds, respectively. Select a different integer due date for each job from the interval [5, 20). Solve the problem and find the optimal job sequence(s) using branch & bound method. Draw the branch & bound tree properly. Show each iteration and step very explicitly. Draw the Gantt chart of each step. For each node: compute the lower bound (LB) and indicate the preemptiveon-preemptive status of the corresponding schedule. When you disregard (eliminate) a node, explain how/why you eliminate 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: Job 1 Job 2 Job 3 Job 4 12 14 PI P2 p3 P4 di dz d3 de