Pattern reduction in one-dimensional cutting stock problems
From MaRDI portal
Publication:4497274
DOI10.1080/002075400188780zbMath0944.90546OpenAlexW2145531116MaRDI QIDQ4497274
Gerhard Wäscher, Hildegard Foerster
Publication date: 22 August 2000
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075400188780
Related Items
A residual recombination heuristic for one-dimensional cutting stock problems ⋮ Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem ⋮ 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 ⋮ Combined cutting stock and lot-sizing problem with pattern setup ⋮ 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 ⋮ On the cutting stock problem under stochastic demand ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ 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 ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ Optimal job splitting on a multi-slot machine with applications in the printing industry ⋮ Solving a combined cutting-stock and lot-sizing problem with a column generating procedure ⋮ Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost ⋮ 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 ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ Modified greedy heuristic for the one-dimensional cutting stock problem ⋮ 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
Uses Software
