Algorithms for NP-Hard Problems (Section 20.1: Makespan Minimization) [Part 1 of 2]
Tim Roughgarden Lectures · 19:18
Graham’s list-scheduling algorithm is a fast greedy heuristic for the NP-hard makespan-minimization problem: assign each job to the currently lightest machine, run in near-linear time, and never produce a makespan wor...