Lower bounds for a bin packing problem with linear usage cost

In this paper, we address a one-dimensional bin packing problem with bin-specific usage cost. The cost coefficients have a direct linear relationship to the bin index, favoring packings with higher loads in "earlier" bins. We show how lower bounding schemes known from standard bin packing can be adapted to fit this objective function and conduct a worst-case performance analysis. The contribution also covers a conceptually new lower bound for the problem at hand. Computational experience based on randomly generated instances and benchmark libraries provides strong evidence for high quality bounds achievable with low computational effort. This observation is further underpinned by a successful embedding of the lower bounds into a branch-and-bound approach as a computational framework. Clear advantages over a state-of-the-art mixed-integer programming formulation can be obtained for particular problem settings. (C) 2018 Elsevier B.V. All rights reserved.