An adaptive branching rule for the permutation flow-shop problem (Q1141078)
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: An adaptive branching rule for the permutation flow-shop problem |
scientific article; zbMATH DE number 3681480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An adaptive branching rule for the permutation flow-shop problem |
scientific article; zbMATH DE number 3681480 |
Statements
An adaptive branching rule for the permutation flow-shop problem (English)
0 references
1980
0 references
adaptive branching rule
0 references
permutation flow-shop problem
0 references
branch-and-bound algorithm
0 references
upper bounds
0 references
search tree
0 references
computational results
0 references
minimization of maximum completion time
0 references
