title: 2D Bin Packing with Multiple Size Bins
body: <p>Lets say we have multiple sizes of bins defined by Length x Width , those could be called "raw material" sizes. </p>
  
  <p>I need to cut certain amount of tables (rectangles, in guillotine form) out of that raw material so that the amount of raw material is minimized.</p>
  
  <p>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". </p>
  
  <p>I know this is a NP-Complete problem and I don't expect a deterministic algorithm in a polynomial time.</p>
  
  <p>I need an algorithm that solves the problem.</p>
  
  <p>Any suggestions would be helpful!</p>
  
  <p>Thanks</p>