Bin packing problems are a class of NP-hard combinatorial optimisation challenges with wide-ranging applications in logistics, manufacturing, cloud computing and scheduling.

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 ...

The Journal of the Operational Research Society, Vol. 69, No. 1 (JANUARY 2018), pp. 78-90 (13 pages) This paper addresses a three-dimensional bin packing problem (3D-BPP) with rotation. The aim is ...