Give n workers n tasks for the least total cost with a DP over the set of tasks already given out, one bitmask per set: 2ⁿ masks and n · 2ⁿ⁻¹ tries, against n! orders for trying them all.
This interactive visualization needs JavaScript.