The cutting stock problem in a hardboard industry: A case study.
From MaRDI portal
Publication:1406647
DOI10.1016/S0305-0548(97)00087-7zbMath1042.90582OpenAlexW2092151354MaRDI QIDQ1406647
Valdir Garcia, Reinaldo Morabito
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00087-7
Mathematical modelsDynamic programmingInteger programmingRandom processesOperations researchCuttingProblem solvingCutting stock problemsMicrocomputers
Integer programming (90C10) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)
Related Items (11)
Optimising the cutting of wood fibre plates in the hardboard industry ⋮ The constrained compartmentalised knapsack problem ⋮ A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems ⋮ An enumeration scheme to generate constrained exact checkerboard patterns ⋮ O problema de corte de estoque em indústrias de móveis de pequeno e médio portes ⋮ Heuristic algorithm for a cutting stock problem in the steel bridge construction ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ Strip generation algorithms for constrained two-dimensional two-staged cutting problems ⋮ A note on linear models for two-group and three-group two-dimensional guillotine cutting problems ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
Uses Software
Cites Work
- Unnamed Item
- Cutting and packing. Special issue
- The trim-loss and assortment problems: A survey
- Packing problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- A typology of cutting and packing problems
- A Linear Programming Approach to the Cutting-Stock Problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An Algorithm for Two-Dimensional Cutting Problems
- The G4-Heuristic for the Pallet Loading Problem
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: The cutting stock problem in a hardboard industry: A case study.