Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry
Year of publication: |
2014
|
---|---|
Authors: | Kim, Kyungdoc ; Kim, Byung-in ; Cho, Hyunbo |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 52.2014, 19 (1.10.), p. 5675-5689
|
Subject: | two-stage cutting stock problem | cutting stock problem | multiple-choice knapsack problem | knapsack algorithm | paper mill industry | Packproblem | Packing problem | Papierindustrie | Pulp and paper industry | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research | Heuristik | Heuristics |
-
Models and algorithms for the bin-packing problem with minimum color fragmentation
Mehrani, Saharnaz, (2022)
-
Irregular packing problems : a review of mathematical models
Leao, Aline A. S., (2020)
-
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Martinovic, John, (2021)
- More ...
-
Integration of queuing network and IDEF3 for business process analysis
Jeong, Ki‐Young, (2008)
-
Partial least square-based model predictive control for large-scale manufacturing processes
Song, Kyuchul, (2002)
-
Jeong, Buhwan, (2005)
- More ...