One-dimensional stock cutting resilient against singular random defects
Year of publication: |
2023
|
---|---|
Authors: | Arbib, Claudio ; Marinelli, Fabrizio ; Pferschy, Ulrich ; Ranjbar, Fatemeh K. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 157.2023, p. 1-14
|
Subject: | Cutting stock | Bin packing | Recoverable defects | Dynamic programming | Mixed integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Dynamische Optimierung | Packproblem | Packing problem |
-
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
Furini, Fabio, (2017)
-
The one-dimensional cutting stock problem with sequence-dependent cut losses
Garraffa, Michele, (2016)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
On cutting stock with due dates
Arbib, Claudio, (2014)
-
Arbib, Claudio, (2016)
-
An LP-based tabu search for batch scheduling in a cutting process with finite buffers
Arbib, Claudio, (2012)
- More ...