Pattern minimisation in cutting stock problems
In the cutting stock pattern minimisation problem, we wish to satisfy demand for various customer reels by cutting as few as possible jumbo reels, and further to minimise the number of distinct cutting patterns used. We focus on the special case in which any two customer reels fit into a jumbo, but no three do: this case is of interest partly because it is the simplest case that is not trivial, and partly because it may arise in practice when one attempts to improve a solution iteratively. We find that the pattern minimisation problem is strongly NP-hard even in this special case, when the basic problem of finding a minimum waste solution is trivial. Our analysis focusses on `balanced' subsets, and suggests an approach for heuristic methods involving searching for balanced subsets.
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Pattern reduction in one-dimensional cutting stock problems
- An algorithm for a cutting stock problem on a strip
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- scientific article; zbMATH DE number 52589 (Why is no real title available?)
- scientific article; zbMATH DE number 3999654 (Why is no real title available?)
- Optimal solutions for the cutting stock problem
- Simple Constructions of Almost k-wise Independent Random Variables
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
- The modified differencing method for the set partitioning problem with cardinality constraints
- The NP-completeness column: An ongoing guide
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Strips minimization in two-dimensional cutting stock of circular items
- Determining cutting stock patterns when defects are present
- Combined cutting stock and lot-sizing problem with pattern setup
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- One-dimensional cutting stock problem to minimize the number of different patterns
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- Modified greedy heuristic for the one-dimensional cutting stock problem
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Fast pattern-based algorithms for cutting stock
- Solution approaches for the cutting stock problem with setup cost
- Optimal job splitting on a multi-slot machine with applications in the printing industry
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- Computer-assisted proof of performance ratios for the differencing method
- Pattern reduction in one-dimensional cutting stock problems
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- RNA triplet repeats: improved algorithms for structure prediction and interactions
- Random-key optimizer with reinforcement learning for the capacitated multi-period cutting stock problem with setup cost
- In situ column generation for a cutting-stock problem
This page was built for publication: Pattern minimisation in cutting stock problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961237)
