An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072)
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 improved branch-and-bound algorithm for the two machine total completion time flow shop problem |
scientific article; zbMATH DE number 1762723
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved branch-and-bound algorithm for the two machine total completion time flow shop problem |
scientific article; zbMATH DE number 1762723 |
Statements
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (English)
0 references
3 July 2002
0 references
flow shop scheduling
0 references
branch-and-bound
0 references
Lagrangean relaxation
0 references
0 references
