One-dimensional cutting stock problem to minimize the number of different patterns
From MaRDI portal
Publication:1869576
DOI10.1016/S0377-2217(02)00239-4zbMath1012.90045OpenAlexW1995169268MaRDI QIDQ1869576
Shunji Umetani, Toshihide Ibaraki, Mutsunori Yagiura
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00239-4
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (27)
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 ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ Alternative configurations for cutting machines in a tube cutting mill ⋮ One-dimensional cutting stock optimization in consecutive time periods ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ In situ column generation for a 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 cutting stock problem with sequence dependent setup times ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Facets of a mixed-integer bilinear covering set with bounds on variables ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ Optimal job splitting on a multi-slot machine with applications in the printing industry ⋮ On LP relaxations for the pattern minimization problem ⋮ 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 ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm ⋮ New lower bounds based on column generation and constraint programming for the pattern minimization problem ⋮ An effective solution for a real cutting stock problem in manufacturing plastic rolls ⋮ Multi-commodity supply network planning in the forest supply chain ⋮ An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sequential heuristic procedure for one-dimensional cutting
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Cutting stock problems and solution procedures
- Random search in the one-dimensional cutting stock problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- One-dimensional cutting stock decisions for rolls with multiple quality grades
- Optimal solutions for the cutting stock problem
- Pattern minimisation in cutting stock problems
- A Linear Programming Approach to the Cutting-Stock Problem
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Approximate Algorithms for the 0/1 Knapsack Problem
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
This page was built for publication: One-dimensional cutting stock problem to minimize the number of different patterns
