A polynomial computational bounded resources heuristic for the Three-Dimensional Bin Packing Problem (3D-BPP) is suggested. The major contribution is the introduction of static stability of the packing and the criteria used for such a packing are described in details. The filling process follows the well known 3-D corner approach. The problem is NP-Hard in the strong sense and extremely difficult to be solved in the practice. Extensive computational experiments are also presented, with instances up to 90 items, with and without static stability. The results are compared with those obtained from the literature.
three-dimensional bin packing problem; packing with static stability
