A pattern reduction procedure in a one-dimensional cutting stock problem by grouping items according to their demands

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.6062/JCIS.2009.01.02.0019
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A heuristic for the one-dimensional cutting stock problem with pattern reduction

  2008influential reference
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems

  2006influential reference
• One-dimensional cutting stock problem to minimize the number of different patterns

  2003cited by this paper
• Algumas extensões do problema de corte de estoque

  2003cited by this paper
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

  2000cited by this paper
• Pattern reduction in one-dimensional cutting stock problems

  2000cited by this paper
• Pattern Minimisation in Cutting Stock Problems

  1999cited by this paper
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem

  1995cited by this paper
• A typology of cutting and packing problems

  1990cited by this paper
• A one-dimensional cutting stock problem in the aluminium industry and its solution

  1990cited by this paper
• Fixed charge problems with identical fixed charges

  1984cited by this paper
• The trim-loss and assortment problems: A survey

  1980cited by this paper
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem

  1976cited by this paper
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems

  1975cited by this paper
• A Linear Programming Approach to the Cutting Stock Problem---Part II

  1963cited by this paper
• A Linear Programming Approach to the Cutting-Stock Problem

  1961cited by this paper

• Random-Key Optimizer with reinforcement learning for the Capacitated Multi-period Cutting Stock Problem with setup cost

  2025cites this paper
• OPTICUT: a new heuristic algorithm for the one-dimensional cutting stock problem with pattern minimization

  2025cites this paper
• A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem

  2024cites this paper
• Bi-objective Optimization for Rebar Cutting Plan Using Symbiotic Organisms Search

  2022cites this paper
• Modified Greedy Heuristic for the one-dimensional cutting stock problem

  2021cites this paper
• ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SINGLE AND MULTIPLE STOCK LENGTHS USING DPSO

  2018cites this paper
• Efficient Least-Loss Algorithm for a Bi-Objective Trim-Loss Problem

  2017cites this paper
• Heurísticas para o problema de corte de estoque unidimensional inteiro: novas contribuições

  2015cites this paper
• A genetic algorithm for the one-dimensional cutting stock problem with setups

  2014cites this paper
• A review of three decades of research on some combinatorial optimization problems

  2013cites this paper
• Sequential grouping heuristic for the two-dimensional cutting stock problem with pattern reduction

  2013cites this paper
• EXTENSIONS OF CUTTING PROBLEMS: SETUPS*

  2013cites this paper
• Solution approaches for the cutting stock problem with setup cost

  2013cites this paper
• A CAM system for one-dimensional stock cutting

  2012cites this paper
• PROGRAMAÇÃO LINEAR INTEIRA PARA O PROBLEMA DE CORTE UNIDIMENSIONAL DE ESTOQUE COM REAPROVEITAMENTO DOS RESÍDUOS INTEGER LINEAR PROGRAMMING FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH WASTE REUSE

  2011cites this paper
• One-Dimensional Cutting Stock Optimization with Usable Leftover: A Case of Low Stock-to-Order Ratio

  2011cites this paper
• Algoritmo discreto del búfalo africano para resolver el problema de corte de material de una dimensión Discrete african bu ff alo algorithm to solve the one-dimensional cutting stock problem

  year unknowncites this paper