Balanced Weight Distribution in Bins/Buckets
It seems that this is exactly the $k$-partition problem, which is NP-hard even in the $k=3$ case.

There are decent approximation algorithms, though:


Greedy provides a $\tfrac{4}{3} - \tfrac{1}{3k}$-approximation (a PTAS).
FPTAS exist.