Pattern minimisation in cutting stock problems
From MaRDI portal
DOI10.1016/S0166-218X(99)00112-2zbMATH Open0987.90085OpenAlexW2093285251MaRDI QIDQ1961237FDOQ1961237
Publication date: 17 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00112-2
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
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- Simple Constructions of Almost k-wise Independent Random Variables
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- The NP-completeness column: An ongoing guide
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Optimal solutions for the cutting stock problem
- The modified differencing method for the set partitioning problem with cardinality constraints
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- 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
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- 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
- 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
- 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)
