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 the normal view instead:
scientific article; zbMATH DE number 1762723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.910271942615509
0 references
0.908286988735199
0 references
0.8923549056053162
0 references
0.8746265172958374
0 references
0.8709119558334351
0 references
