Suppose there're $N$ weighted balls and $M$ equal weight bins, it's guaranteed at least one placement exists that all the balls can be placed into bins.
What's the right algorithm to achieve a well-balanced placement where each bin has almost equal weights of balls?
I know if the bins are of different weights, the problem is NP-hard; Not sure a simplified question can be solved in linear time.
I'd appreciate any references where I could find some papers discussing the complexity and solutions related. Thank you!
