A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
From MaRDI portal
Publication:1847199
DOI10.1016/S0377-2217(02)00128-5zbMath1081.90572MaRDI QIDQ1847199
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (6)
An integrated cutting stock and sequencing problem ⋮ A two-dimensional strip cutting problem with sequencing constraint ⋮ Mathematical models for the minimization of open stacks problem ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ The one-dimensional cutting stock problem with sequence-dependent cut losses ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for sequencing cutting patterns
- Near-optimal solutions to one-dimensional cutting stock problems
- Establishing the optimality of sequencing heuristics for cutting stock problems
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Heuristic and exact methods for the cutting sequencing problem
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Improved heuristics for sequencing cutting patterns
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- A Linear Programming Approach to the Cutting-Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
