We show that some of the best heuristics developed for the classical bin packing problem can perform poorly under the general cost structure. On the other hand, the so-called next-fit increasing ...

Given a set of rectangular pieces to be cut from an unlimited number of standardized stock pieces (bins), the Two-Dimensional Finite Bin Packing Problem is to determine the minimum number of stock ...