ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines

Lars Rohwedder

Given $n$ jobs with processing times $p_1,\dots ,p_n\in \mathbb{N}$ and $m\le n$ machines with speeds $s_1,\dots ,s_m\in \mathbb{N}$ our goal is to allocate the jobs to machines minimi…