Pattern minimisation in cutting stock problems
From MaRDI portal
Recommendations
- 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
Cites work
- scientific article; zbMATH DE number 52589 (Why is no real title available?)
- scientific article; zbMATH DE number 3999654 (Why is no real title available?)
- 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
- 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 NP-completeness column: An ongoing guide
- The modified differencing method for the set partitioning problem with cardinality constraints
Cited in
(22)- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Combined cutting stock and lot-sizing problem with pattern setup
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- Computer-assisted proof of performance ratios for the differencing method
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- In situ column generation for a cutting-stock problem
- Solution approaches for the cutting stock problem with setup cost
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- Fast pattern-based algorithms for cutting stock
- RNA triplet repeats: improved algorithms for structure prediction and interactions
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- Modified greedy heuristic for the one-dimensional cutting stock problem
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Strips minimization in two-dimensional cutting stock of circular items
- Random-key optimizer with reinforcement learning for the capacitated multi-period cutting stock problem with setup cost
- One-dimensional cutting stock problem to minimize the number of different patterns
- Optimal job splitting on a multi-slot machine with applications in the printing industry
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)
