On a pattern sequencing problem to minimize the maximum number of open stacks

DOI10.1016/S0377-2217(97)84107-0MaRDI QIDQ1278124zbMATH OpenFDO

Authors Horacio Hideki Yanasse

Publication date 22 February 1999

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

zbMATH Keywords

branch-and-boundflexible manufacturing systemstool switchespattern sequencingwood cutting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Dynamic programming to minimize the maximum number of open stacks
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• An approximation algorithm for the stack-up problem
• scientific article; zbMATH DE number 1782346
• Stack-sorting with consecutive-pattern-avoiding stacks
• Some open problems on permutation patterns
• Sequential algorithm for the solution of problems of combinatorial optimization on permutations
• Stack-sorting, set partitions, and Lassalle's sequence
• On the sequential ordering problems
• scientific article; zbMATH DE number 1538846

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Complexity Results for Bandwidth Minimization
• Heuristics for sequencing cutting patterns
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches

Cited in

(21)

• A two-dimensional strip cutting problem with sequencing constraint
• Optimising the cutting of wood fibre plates in the hardboard industry
• 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
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• scientific article; zbMATH DE number 2014735 (Why is no real title available?)
• A biased random-key genetic algorithm for the minimization of open stacks problem
• A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
• An integrated cutting stock and sequencing problem
• An improved typology of cutting and packing problems
• A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
• A heuristic and an exact method for the gate matrix connection cost minimization problem
• A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
• Two-dimensional cutting stock problem with sequence dependent setup times
• An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint
• Mathematical models for the minimization of open stacks problem
• Dynamic programming to minimize the maximum number of open stacks
• A multiple-population evolutionary approach to gate matrix layout
• On the one-dimensional stock cutting problem in the paper tube industry
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais

This page was built for publication: On a pattern sequencing problem to minimize the maximum number of open stacks

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