A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
Year of publication: |
2020
|
---|---|
Authors: | Pitombeira-Neto, Anselmo Ramalho ; Prata, Bruno de Athayde |
Subject: | Cutting and packing problems | Order scheduling problems | Fix-and-optimize | Matheuristics | Scheduling-Verfahren | Scheduling problem | Packproblem | Packing problem | Theorie | Theory | Algorithmus | Algorithm | Operations Research | Operations research | Heuristik | Heuristics |
-
A single machine scheduling problem with two-dimensional vector packing constraints
Billaut, Jean-Charles, (2015)
-
A genetic algorithm for two-dimensional bin packing with due dates
Bennell, Julia A., (2013)
-
An adaptive selection approach for the 2D rectangle packing area minimization problem
Wei, Lijun, (2018)
- More ...
-
Araújo, Kennedy A. G., (2021)
-
Pitombeira-Neto, Anselmo Ramalho, (2020)
-
Abreu, Levi Ribeiro de, (2020)
- More ...