Drop duplicate fix

src/sched_policies/component_heft.c

@@ -111,7 +111,7 @@ static int heft_progress_one(struct starpu_sched_component *component)
 		}
 
 		int best_task = 0;
-		double max_benefit =  max_exp_end_with_task[0] - min_exp_end_with_task[0];
+		double max_benefit = 0;
 
 		/* Find the task which provides the most computation time benefit */
 		for (n = 1; n < ntasks; n++)