Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221)
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: Elimination conditions and lower bounds for the permutation flow-shop sequencing problem |
scientific article; zbMATH DE number 4018753
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Elimination conditions and lower bounds for the permutation flow-shop sequencing problem |
scientific article; zbMATH DE number 4018753 |
Statements
Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (English)
0 references
1985
0 references
We give some new elimination conditions for permutation flow-shop problems and prove that there is one among them equivalent to Szwarc's elimination condition. Next we propose some new lower bounds for a branch-and-bound method and design an algorithm. Computational results indicate that the proposed algorithm is more efficient than those we found in the literature.
0 references
elimination conditions
0 references
permutation flow-shop
0 references
lower bounds
0 references
branch-and- bound
0 references
Computational results
0 references
0 references
