In this study, we examine a two-dimensional bin-packing problem in printed circuit board manufacturing. Among other objectives, the number of bins, but also the number of different bin layouts, is to be minimized. As the running times of an earlier MIP presentation are only acceptable for small problem instances, we will now discuss a branch-and-price approach by using an adapted Ryan-Foster-branching. The pricing problem computes the layouts, separating the time-consuming constraints from the master problem.
Cite
@article{arxiv.2509.01218,
title = {Column-generation for a two-dimensional multi-criteria bin-packing problem},
author = {Christof Groschke and Steffen Goebbels and Jochen Rethmann},
journal= {arXiv preprint arXiv:2509.01218},
year = {2025}
}