On a pattern sequencing problem to minimize the maximum number of open stacks
From MaRDI portal
Publication:1278124
DOI10.1016/S0377-2217(97)84107-0zbMath0917.90205MaRDI QIDQ1278124
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (17)
An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint ⋮ Refinements on an enumeration scheme for solving a pattern sequencing problem ⋮ A method for solving the minimization of the maximum number of open stacks problem within a cutting process ⋮ An improved typology of cutting and packing problems ⋮ An integrated cutting stock and sequencing problem ⋮ A two-dimensional strip cutting problem with sequencing constraint ⋮ Optimising the cutting of wood fibre plates in the hardboard industry ⋮ Two-dimensional cutting stock problem with sequence dependent setup times ⋮ Mathematical models for the minimization of open stacks problem ⋮ Connections between cutting-pattern sequencing, VLSI design, and flexible machines ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ A multiple-population evolutionary approach to gate matrix layout ⋮ A biased random-key genetic algorithm for the minimization of open stacks problem ⋮ 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 minimization of open stacks problem: a review of some properties and their use in pre-processing operations ⋮ A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
Cites Work
- Unnamed Item
- Heuristics for sequencing cutting patterns
- 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
- Complexity Results for Bandwidth Minimization
This page was built for publication: On a pattern sequencing problem to minimize the maximum number of open stacks
