I'm working on a problem that is very similar to the bin packing problem, but for me, the objective is to minimize the maximum weight given m bins. The problem statement is:
Given n items, each with a certain weight less than some maximum weight (w_max), how do you pack them into m bins so that you minimize the maximum weight (over all bins)?
I'm looking at a possible approach that would simply iterate by grouping the two smallest weight items until the number of groups equals the number of bins.
Has anyone heard of a similar problem and know of an approach to solve this with some guarantees?