Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
From MaRDI portal
Publication:296762
DOI10.1016/j.ejor.2014.03.027zbMath1338.90233OpenAlexW2085581196MaRDI QIDQ296762
Steffen Rebennack, Rüdiger Kusche, Josef Kallrath, Julia Kallrath
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.03.027
Related Items
Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost, Two-dimensional cutting stock problem with sequence dependent setup times, Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation, Two dimensional guillotine cutting stock and scheduling problem in printing industry, A heuristic approach to minimize the number of saw cycles in small-scale furniture factories, Heuristic algorithms based on column generation for an online product shipping 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, Solving two-dimensional cutting stock problem via a DNA computing algorithm, A Description of Supply Chain Planning Problems in the Paper Industry with Literature Review, A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems, Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches, Orientational variable-length strip covering problem: a branch-and-price-based algorithm, A bi-integrated model for coupling lot-sizing and cutting-stock problems
Cites Work
- On the cutting stock problem under stochastic demand
- Polylithic modeling and solution approaches using algebraic modeling systems
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- The combined cutting stock and lot-sizing problem in industrial processes
- One-dimensional cutting stock optimization in consecutive time periods
- A coupling cutting stock-lot sizing problem in the paper industry
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- The stochastic trim-loss problem
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Cutting circles and polygons from area-minimizing rectangles
- The one-dimensional cutting stock problem with due dates
- The modified integer round-up property of the one-dimensional cutting stock problem
- Cutting stock problems and solution procedures
- One-dimensional cutting stock problems and solution procedures
- Different transformations for solving non-convex trim-loss problems by MINLP
- A new model for complete solutions to one-dimensional cutting stock problems.
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- Pattern minimisation in cutting stock problems
- Cutting ellipses from area-minimizing rectangles
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- Accelerating column generation for variable sized bin-packing problems
- An integrated cutting stock and sequencing problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Multi-job Cutting Stock Problem with Due Dates and Release Dates
- Cutting Stock Problems
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
