Heuristics for sequencing cutting patterns

DOI10.1016/0377-2217(91)90222-HzbMATH Open0729.90997OpenAlexW1974206331MaRDI QIDQ807386FDOQ807386

Boon J. Yuen

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90222-h

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions
• Glass cutting in a small firm

Cited In (18)

• A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
• An interactive technique for the cutting stock problem with multiple objectives
• A biased random-key genetic algorithm for the minimization of open stacks problem
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• Mathematical models for the minimization of open stacks problem
• On the one-dimensional stock cutting problem in the paper tube industry
• Heuristic and exact methods for the cutting sequencing problem
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• Establishing the optimality of sequencing heuristics for cutting stock problems
• On a pattern sequencing problem to minimize the maximum number of open stacks
• Simulated annealing for order spread minimization in sequencing cutting patterns
• Improved heuristics for sequencing cutting patterns
• An integrated cutting stock and sequencing problem
• Lock-free parallel dynamic programming
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods
• A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry

This page was built for publication: Heuristics for sequencing cutting patterns

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