Question: Is the following statement correct. The greedy list scheduling algorithm for load balancing that we went though in the lecture, produces a solution that always

Is the following statement correct. The greedy list scheduling algorithm for load balancing that we went though in the lecture, produces a solution that always has a makespan that is exactly twice as much as the optimal solution. O True O False
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
