Bin packing approximation with different bin sizes
I started a project under MIT license to try to solve this problem.  Currently it uses the 'best fit' approach.  Sorts 'items' from largest to smallest and sorts bins from smallest to largest.  Finds first bin that is large enough to use that has ALREADY been used (if possible).  Let's see if we can make it a good enough solution for all.

https://github.com/asharif/packit4.me