In this paper, we propose a greedy heuristic for the 2D rectangular packing problem (2DRP)
that represents packings using a skyline; the use of this heuristic in a simple tabu search …

This work aims to propose a binary version of a new metaheuristic in order to solve the two-
dimensional bin packing problem (2D-BPP) which is a NP-hard optimization problem in a …

A heuristic approach for the two-dimensional bin-packing problem is proposed. The
algorithm is based on the sequential heuristic procedure that generates each pattern to …

This paper considers the two-dimensional strip-packing problem (2SP) in which a set of
rectangular items have to be orthogonally packed, without overlapping, into a strip of a given …

The two-dimensional non-oriented bin packing problem with due dates packs a set of
rectangular items, which may be rotated by 90°, into identical rectangular bins. The bins …

We present a two-stage methodology called Positions and Covering (P&C) to solve the two-
dimensional bin packing problem (2D-BPP). The objective of this classical combinatorial NP …

This research investigates the Three Dimensional-Single Bin-Size Bin-Packing Problem (3D-
SBSPP). The aim is to pack n boxes of different dimensions and weights into a minimum …

A new heuristic algorithm for solving the two-dimensional bin-packing problem with
guillotine cuts (2DBP|⁎| G) is presented. The heuristic constructs a solution by packing a bin …

The problem of packing two-dimensional items into two-dimensional bins is considered in
which patterns of items allocated to bins must be guillotine-cuttable and item rotation might …

The parallel batch processing machine scheduling problem with two-dimensional bin
packing constraints (PBS-2D) has appeared in many industrial environments, but the …