Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
From MaRDI portal
Publication:2892308
DOI10.1287/ijoc.1050.0132zbMath1241.90070OpenAlexW2150442637MaRDI QIDQ2892308
Guntram Scheithauer, Gleb Belov
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/deaa81338159acc5ec6ab4cfa5bc021b2657dac1
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (24)
Sequential heuristic for the two-dimensional bin-packing problem ⋮ Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost ⋮ Combined cutting stock and lot-sizing problem with pattern setup ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ Mathematical models for the minimization of open stacks problem ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Cutting stock with no three parts per pattern: work-in-process and pattern minimization ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ A Review for Submodular Optimization on Machine Scheduling Problems ⋮ A sequential value correction heuristic for a bi-objective two-dimensional bin-packing ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm ⋮ One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ An effective solution for a real cutting stock problem in manufacturing plastic rolls ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem ⋮ Strips minimization in two-dimensional cutting stock of circular items ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
This page was built for publication: Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
