Consider the 7 projects represented by the AON networks below. The projects require the resources A, B, C, D, E, F, G, H, and I, and the durations for all activities performed by these resources have one time unit duration. Find a feasible solution for the completion time of all projects, keeping in mind that a resource cannot be used on more than one project at any given time. Compare the solution with the lower bound obtained by considering resource A only (you can obtain the lower bound on the solution by making sure that resource A is not used by more than one project at any given time).

Consider the projects represented by the AON networks below. The projects require the resources A, B, C, D, E, F, G, H, and I, and the durations for all activities performed by these resources have nne time unit duration. Find a feasible solution for the completion time of all projects, keeping in mind that a resource cannot be used on more than one project at any given time. Compare the solution with the lower bound obtained by considering resource A only (you can obtain the lower bound on the solution by making sure that resource A is not used by more than one project at any given time) Project 1: project 7: Project 2: Project 3 Project 4 Project 5: Project 6: Consider the projects represented by the AON networks below. The projects require the resources A, B, C, D, E, F, G, H, and I, and the durations for all activities performed by these resources have nne time unit duration. Find a feasible solution for the completion time of all projects, keeping in mind that a resource cannot be used on more than one project at any given time. Compare the solution with the lower bound obtained by considering resource A only (you can obtain the lower bound on the solution by making sure that resource A is not used by more than one project at any given time) Project 1: project 7: Project 2: Project 3 Project 4 Project 5: Project 6