Integer linear programming for a cutting problem in the wood-processing industry: a case study

DOI10.1111/j.1475-3995.2009.00704.xzbMath1179.90235OpenAlexW2027991349MaRDI QIDQ3401328

Gerhard Wäscher, Sören Koch, Sebastian König

Publication date: 29 January 2010

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00704.x

zbMATH Keywords

integer linear programmingone-dimensional cuttingwood-processing industry

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (8)

The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Comparison of discrete- and continuous-time models for scheduling waste wood processing facilities ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ Efficient algorithms for real-life instances of the variable size bin packing problem ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey

Cites Work

• One-dimensional cutting stock optimization in consecutive time periods
• The one-dimensional cutting stock problem with usable leftover - a heuristic approach
• A typology of cutting and packing problems
• An improved typology of cutting and packing problems
• The Trim Problem
• A note on handling residual lengths

This page was built for publication: Integer linear programming for a cutting problem in the wood-processing industry: a case study