title: Algorithm To Make Best Use of Multiple Linear Container Space
body: <p>I have a set number of equal sized linear "containers." For this example say I have 10 containers that can hold up to a maximum value of 28. These containers are filled serially with incoming objects of varying values. The objects will have a known minimum and maximum value, for this example the minimum would be 3.5 and the maximum 15. The objects can be any size between this minimum and maximum. The items leave the containers in an unknown order. If there is not enough room in any of the containers for the next incoming object it is rejected.</p>
  
  <p>I am looking for an algorithm that utilizes the container space the most efficiently and minimizes the amount of rejected objects.</p>