The suggested technique has the following benefits:
1.The complexity might develop non-polynomials if the precedence constraints and resource limitations are relatively permissive.The method might provide many answers by either creating a set of ideal solutions from which to pick, or by removing some bounds to get additional near-optimal solutions.c. The amount of limitations imposed by precedence (immediate predecessors)
d. The number of activities that consume the greatest amount of resources
4.More tight bounds might assist reduce complexity in such circumstances, but the cost would be finding a non-delay solution that isn't always the optimal.The best non-delay solution, a class of schedules known to contain near-optimal solutions, is the solution.These the solution complexity is reduced by attributes.stages.2.3.5.