We consider the two-dimensional Cutting Stock Problem (2D-CSP), where stocks of bounded sizes are available.
This variant is labeled as the two-dimensional Bounded-Size Cutting Stock Problem (2D-BSCSP).
It essentially consists of cutting a set of small rectangular items of given sizes from a set of rectangular larger plates with bounded height and width.
The generated cutting patterns are limited to two guillotine stages with trimming.
The main objective function is to minimize the total production.
The 2D-BSCSP is formulated as a strip-based mixed integer linear program and solved using a strip-based matheuristics, by considering strip selection and compatibilities computation procedures.
Computational experiments were performed on two sets of instances from the literature available at ~http://or.dei.unibo.it/library/2dpacklib.