A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing

In this work we address the orthogonal non-oriented two-dimensional bin packing problem where items are equipped with due-dates and the bi-objective function takes into account both the number of used bins and the maximum lateness of items. We propose a sequential value correction heuristic that outperforms the benchmark algorithm specifically designed for the same problem, and we finally give some insight on the structure of the Pareto-optimal sets of the considered classes of instances.