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

DOI10.1111/ITOR.12095MaRDI QIDQ2803252zbMATH OpenOpenAlexFDO

Authors Michele Garraffa, Fabio Salassa, Wim Vancroonenburg, Greet Vanden Berghe, T. Wauters

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

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

Recommendations

• One-dimensional cutting stock problems and solution procedures
• A new heuristic algorithm for the one-dimensional cutting stock problem
• One-dimensional cutting stock optimization in consecutive time periods
• On the one-dimensional stock cutting problem in the paper tube industry
• One-dimensional cutting stock problem to minimize the number of different patterns

Cites work

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

Cited in

(6)

• Classification and literature review of integrated lot-sizing and cutting stock problems
• A cutting stock problem in the wood products industry: a two‐stage solution approach
• A residual recombination heuristic for one-dimensional cutting stock problems
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries
• Mathematical models for the cutting stock with limited open stacks problem
• Exact and approximate methods for the score-constrained packing problem

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803252)