Packing problem

Given a finite set of infinite, one-dimensional bins and a collection of
one-dimensional items. I want to distribute the items over the bins so that
the variance of the bin contents is minimal. What algorithm do I use? (As a
silly heuristic, I come up with: sort the items by length and put them, in
order, from long to short, in the least filled bin)


.

Relevant Pages

  • Re: Packing problem
    ... > Given a finite set of infinite, one-dimensional bins and a collection of ... I want to distribute the items over the bins so ... However zero variance is attainable in this example: ...
    (sci.math)
  • Re: Reduction of variance due to grouping
    ... allow a good upper bound estimate of the variance at the optimum. ... Just off the top of my head, I'm thinking about something akin to FFD ... bins - also like the related pipe-cutting problem. ... (though I present no results for how far from optimum it could get, ...
    (sci.stat.math)
  • Balls into Bins with Variable Sized Balls
    ... certain events occurring on throwing n balls at random on m bins. ... Given only the mean and variance ... of the balls set (where the random variable is the size of the ...
    (sci.math)
  • Re: Packing problem
    ... >into, in this case, three sets whose sums have the least variance. ... Let's say your items are x_1,...,x_n and you have k bins. ... the variance can be made 0 is NP-complete). ... closest integer to x_i/M for some suitable integer M. ...
    (sci.math)