Two dimensional guillotine cutting stock and scheduling problem in printing industry
Year of publication: |
2022
|
---|---|
Authors: | Mostajabdaveh, Mahdi ; Salman, F. Sibel ; Tahmasbi, Nadia |
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. 148.2022, p. 1-26
|
Subject: | Cutting stock | Printing industry | Packing heuristics | Genetic algorithm | Nonlinear integer program | Druckindustrie | Scheduling-Verfahren | Scheduling problem | Evolutionärer Algorithmus | Evolutionary algorithm | Heuristik | Heuristics | Theorie | Theory | Packproblem | Packing problem | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Ganzzahlige Optimierung | Integer programming |
-
Exact and approximate methods for the score-constrained packing problem
Hawa, Asyl L., (2022)
-
Abraham, Gyula, (2023)
-
Dynamic reduction heuristics for the rectangle packing area minimization problem
He, Kun, (2015)
- More ...
-
Investing in the links of a stochastic network to minimize expected shortest path length
Viswanath, Kanna, (2004)
-
Reducing the vulnerability of a network through investment : decision dependent link failures
Viswanath, Kannan, (2002)
-
Optimizing product assortment under customer-driven demand substitution
Yücel, Eda, (2009)
- More ...