Dynamic reduction heuristics for the rectangle packing area minimization problem.

•Propose a dynamic reduction heuristic for the rectangle packing area minimization problem (RPAMP).•Propose a least injury first (LIF) heuristic for its sub-problem, the rectangle packing problem (RPP).•Propose an algorithm to compact the layout and prove its feasibility, compactness, non-inferiority and halting properties.•Find new and better solutions for most large-scale RPAMP instances with at least 100 items.