Parallel machine scheduling with nested job assignment restrictions

We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.