The aim of this paper is to classify the literature related to the integration between the lot-
sizing and cutting stock problem. A deterministic mathematical model, that considers …

This paper considers the on-time guillotine cutting of small rectangular items from large
rectangular bins. Items assigned to a bin define the bins' processing time. Consequently, an …

Evolutionary algorithms have been reported to be efficient metaheuristics for the
optimization of several NP-Hard combinatorial optimization problems. In addition to their …

Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

We investigate a general single-batch-processing machine scheduling problem of
minimizing the total costs of all jobs with general convex piecewise linear cost functions …

The glass cutting problem proposed for the ROADEF 2018 challenge is a two-dimensional,
three-stage guillotine cutting process, with an additional cut to obtain pieces in some specific …

We address a two-dimensional cutting stock problem combined with production scheduling
that arises in paper printing industry where printing orders arrive daily, together with their …

In this paper, we study the Variable-Sized Bin Packing Problem with Conflicts and Item
Fragmentation (VSBPPC-IF) that has applications such as (i) the delivery planning of …

The two-dimensional non-oriented bin packing problem with due dates packs a set of
rectangular items, which may be rotated by 90°, into identical rectangular bins. The bins …

In this paper the classical one-dimensional bin packing problem is integrated with
scheduling elements: a due date is assigned to each item and the time required to process …