An integrated cutting stock and sequencing problem
From MaRDI portal
Publication:2643965
DOI10.1016/j.ejor.2005.09.054zbMath1135.90012OpenAlexW2030393261MaRDI QIDQ2643965
Horacio Hideki Yanasse, Maria José Pinto Lamosa
Publication date: 27 August 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.054
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (16)
An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint ⋮ Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ Optimising the cutting of wood fibre plates in the hardboard industry ⋮ Two-dimensional cutting stock problem with sequence dependent setup times ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Mathematical models for the minimization of open stacks problem ⋮ Cutting stock with no three parts per pattern: work-in-process and pattern minimization ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ 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 ⋮ A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders ⋮ The one-dimensional cutting stock problem with due dates ⋮ Strips minimization in two-dimensional cutting stock of circular items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for sequencing cutting patterns
- Cutting and packing. Special issue
- Establishing the optimality of sequencing heuristics for cutting stock problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Exact solutions for constrained two-dimensional cutting problems
- The trim-loss and assortment problems: A survey
- Packing problems
- On a pattern sequencing problem to minimize the maximum number of open stacks
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- Applications of modern heuristic search methods to pattern sequencing problems
- Heuristic and exact methods for the cutting sequencing problem
- A minimal algorithm for the multiple-choice knapsack problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Improved heuristics for sequencing cutting patterns
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- An improved version of Wang's algorithm for two-dimensional cutting problems
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- An improved typology of cutting and packing problems
- Refinements on an enumeration scheme for solving a pattern sequencing problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A New Linear Programming Approach to the Cutting Stock Problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An Algorithm for Two-Dimensional Cutting Problems
- Glass cutting in a small firm
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- Checkerboard pattern: proposals for its generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- An exact algorithm for the subset sum problem
This page was built for publication: An integrated cutting stock and sequencing problem
