Pattern reduction in one-dimensional cutting stock problems
From MaRDI portal
Publication:4497274
Recommendations
Cited in
(40)- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
- Strips minimization in two-dimensional cutting stock of circular items
- Limiting the number of each piece in two-dimensional cutting stock patterns
- A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
- 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
- Pattern minimisation in cutting stock problems
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- Modified greedy heuristic for the one-dimensional cutting stock problem
- A residual recombination heuristic for one-dimensional cutting stock problems
- 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
- Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
- Renovation of the cutting stock process
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
- Solving a bi-criterion cutting stock problem with open-ended demand: a case study
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- 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
- Progressive selection method for the coupled lot-sizing and cutting-stock problem
- Checkerboard pattern: proposals for its generation
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A nonlinear cutting stock problem
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- One-dimensional stock cutting resilient against singular random defects
- On the cutting stock problem under stochastic demand
- On the one-dimensional stock cutting problem in the paper tube industry
- Random-key optimizer with reinforcement learning for the capacitated multi-period cutting stock problem with setup cost
- Classification and literature review of integrated lot-sizing and cutting stock problems
- In situ column generation for a cutting-stock problem
This page was built for publication: Pattern reduction in one-dimensional cutting stock problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497274)
