The one-dimensional cutting stock problem with sequence-dependent cut losses

DOI10.1111/itor.12095zbMath1338.90337OpenAlexW2151594935MaRDI QIDQ2803252

Fabio Salassa, Tony Wauters, Wim Vancroonenburg, Greet vanden Berghe, Michele Garraffa

Publication date: 4 May 2016

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/451717

zbMATH Keywords

integer programmingcutting stockpattern-based heuristicsequence-dependent cut losses

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Exact and approximate methods for the score-constrained packing problem ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems

Uses Software

• VRP

Cites Work

• Solution approaches for the cutting stock problem with setup cost
• An investigation into two bin packing problems with ordering and orientation implications
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
• One-dimensional cutting stock optimization in consecutive time periods
• The vehicle routing problem: An overview of exact and approximate algorithms
• A typology of cutting and packing problems
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
• A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• An improved typology of cutting and packing problems
• A heuristic for the one-dimensional cutting stock problem with usable leftover
• Column Generation based Primal Heuristics
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Computer Solutions of the Traveling Salesman Problem
• New heuristics for one-dimensional bin-packing

This page was built for publication: The one-dimensional cutting stock problem with sequence-dependent cut losses