A note on ” Relations between capacity utilization and minimal bin number “

In the paper ” Relations between capacity utilization and minimal bin number“[HS12] the following two-dimensional bin packing problem (BPP) is considered: given a set K of rectangular items of sizes li × wi and bins of size L×W . Rotation of the items is not permitted. It is shown, if every item fits into the given bin and if the total area of the items does not exceed the area of the bin then at most three bins are needed to pack all items. The bound three is tight. Furthermore, it is shown that if li ≤ L/3 and wi ≤ W/3 for all i ∈ K then at most two bins are necessary to pack all items. In this note we give another, simpler proof of the latter result which is based on properties of the FFDH-heuristic (instead of using NFDH-heuristic as in [HS12]), and we improve it to if li ≤ L/2 and wi ≤ W/3 for all i ∈ K then at most two bins are necessary.