On a pattern sequencing problem to minimize the maximum number of open stacks
type: Item
instance of: scholarly article
title: On a pattern sequencing problem to minimize the maximum number of open stacks
zbMATH Open document ID: 0917.90205
DOI: 10.1016/S0377-2217(97)84107-0
author: Horacio Hideki Yanasse
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1252727
zbMATH Keywords: pattern sequencing
zbMATH Keywords: tool switches
zbMATH Keywords: flexible manufacturing systems
zbMATH Keywords: wood cutting
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
cites work: Complexity Results for Bandwidth Minimization
cites work: Q4198056
cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
cites work: Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
cites work: Heuristics for sequencing cutting patterns
Recommended article: Dynamic programming to minimize the maximum number of open stacks
Recommended article: Refinements on an enumeration scheme for solving a pattern sequencing problem
Recommended article: An approximation algorithm for the stack-up problem
Recommended article: Q4545581
Recommended article: Stack-sorting with consecutive-pattern-avoiding stacks
Recommended article: Some open problems on permutation patterns
Recommended article: Sequential algorithm for the solution of problems of combinatorial optimization on permutations
Recommended article: Stack-sorting, set partitions, and Lassalle's sequence
Recommended article: On the sequential ordering problems
Recommended article: Q4519268
description: scientific article; zbMATH DE number 1252727