On a pattern sequencing problem to minimize the maximum number of open stacks (Q1278124)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a pattern sequencing problem to minimize the maximum number of open stacks |
scientific article; zbMATH DE number 1252727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a pattern sequencing problem to minimize the maximum number of open stacks |
scientific article; zbMATH DE number 1252727 |
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
0.8687632
0 references
0.84262824
0 references
0.83689624
0 references
0.82353127
0 references
0.8218994
0 references
0.81967443
0 references
0.81943464
0 references
0 references
