Mathematical models for the minimization of open stacks problem
From MaRDI portal
Publication:6082193
DOI10.1111/itor.13053OpenAlexW3197120598MaRDI QIDQ6082193
Mateus Martin, Unnamed Author, Horacio Hideki Yanasse
Publication date: 29 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13053
integer linear programmingconstraint programminginterval variablesMOSP graphpattern sequencing problems
Cites Work
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- On the one-dimensional stock cutting problem in the paper tube industry
- Heuristics for sequencing cutting patterns
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
- Establishing the optimality of sequencing heuristics for cutting stock problems
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Applications of modern heuristic search methods to pattern sequencing problems
- Heuristic and exact methods for the cutting sequencing problem
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Improved heuristics for sequencing cutting patterns
- 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
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- An improved typology of cutting and packing problems
- An integrated cutting stock and sequencing problem
- A two-dimensional strip cutting problem with sequencing constraint
- Heuristic methods to consecutive block minimization
- A biased random-key genetic algorithm for the minimization of open stacks problem
- A heuristic and an exact method for the gate matrix connection cost minimization problem
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- Dynamic Programming to Minimize the Maximum Number of Open Stacks
- Refinements on an enumeration scheme for solving a pattern sequencing problem
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Glass cutting in a small firm
This page was built for publication: Mathematical models for the minimization of open stacks problem
