On a pattern sequencing problem to minimize the maximum number of open stacks (Q1278124): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity Results for Bandwidth Minimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristics for sequencing cutting patterns / rank | |||
Normal rank | |||
Latest revision as of 17:29, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a pattern sequencing problem to minimize the maximum number of open stacks |
scientific article |
Statements
On a pattern sequencing problem to minimize the maximum number of open stacks (English)
0 references
22 February 1999
0 references
pattern sequencing
0 references
tool switches
0 references
flexible manufacturing systems
0 references
wood cutting
0 references
branch-and-bound
0 references
0 references
0 references
