Heuristics for sequencing cutting patterns

From MaRDI portal
Publication:807386

DOI10.1016/0377-2217(91)90222-HzbMath0729.90997OpenAlexW1974206331MaRDI QIDQ807386

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




Related Items (18)

Refinements on an enumeration scheme for solving a pattern sequencing problemA method for solving the minimization of the maximum number of open stacks problem within a cutting processAn interactive technique for the cutting stock problem with multiple objectivesAn integrated cutting stock and sequencing problemEstablishing the optimality of sequencing heuristics for cutting stock problemsImproved heuristics for sequencing cutting patternsMathematical models for the minimization of open stacks problemOn the one-dimensional stock cutting problem in the paper tube industryLock-free parallel dynamic programmingHeterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methodsA biased random-key genetic algorithm for the minimization of open stacks problemHeurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionaisA matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous ordersOn a pattern sequencing problem to minimize the maximum number of open stacksThe minimization of open stacks problem: a review of some properties and their use in pre-processing operationsA solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industryHeuristic and exact methods for the cutting sequencing problemSimulated annealing for order spread minimization in sequencing cutting patterns



Cites Work


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