Abstract: A heuristic approach for two-dimensional bin packing problems with guillotine constraints
is proposed to minimize bin usage by maximizing space efficiency through the strategy of value
correction. This heuristic algorithm firstly assigns higher values and packing priorities to items
considered more difficult to pack into residual spaces, then selects packing spaces in descending order
of unused area, and finally expand or merge residual small spaces and add unusable space to the
residual adjacent space set, so as to improve the utilization rate. Simulation experiments on
benchmark test sets suggest that the approach can work effectively and rivals existing other 2DBP
methods.

Key words: two-dimensional bin packing, value correction, guillotine cut, heuristic