2D Bin Packing with Multiple Size Bins
===

Lets say we have multiple sizes of bins defined by Length x Width, those could be called "raw material". 

I need to cut certain amount of tables of various sizes and to minimize the amount of bins I use. 

As the bins do not have the same size they should be somehow factored or prioritize to reflect their value - so a bigger bin is obviously "more expensive". 

I know this is a NP-Complete problem and I don't expect a deterministic algorithm in a polynomial time.

Any suggestions would be helpful!

Thanks


