Reducing the number of cuts in generating three-staged cutting patterns

DOI10.1016/J.EJOR.2011.10.047zbMATH Open1244.90190OpenAlexW2041432756MaRDI QIDQ439502FDOQ439502

Authors: Yaodong Cui, Baixiong Huang 

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.047

Recommendations

• A new dynamic programming procedure for three-staged cutting patterns
• Solving two-dimensional cutting stock problems with three-block patterns
• Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• Strips minimization in two-dimensional cutting stock of circular items

zbMATH Keywords

packingcuttingtwo-dimensional cuttingcuts reduction

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• An improved typology of cutting and packing problems
• The one-dimensional cutting stock problem with due dates
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• An integer programming model for two- and three-stage two-dimensional cutting stock problems
• A combined approach to the solution to the general one-dimensional cutting stock problem
• Models and algorithms for three-stage two-dimensional bin packing
• An inexact bundle approach to cutting-stock problems
• Strips minimization in two-dimensional cutting stock of circular items
• Arc-flow model for the two-dimensional guillotine cutting stock problem
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• The one-dimensional cutting stock problem with usable leftover - a heuristic approach
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• An enumeration scheme to generate constrained exact checkerboard patterns
• A heuristic for the one-dimensional cutting stock problem with usable leftover
• A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
• Checkerboard pattern: proposals for its generation

Cited In (6)

• Two-stage two-dimensional guillotine cutting stock problems with usable leftover
• Two dimensional guillotine cutting stock and scheduling problem in printing industry
• A new dynamic programming procedure for three-staged cutting patterns
• Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns

This page was built for publication: Reducing the number of cuts in generating three-staged cutting patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439502)