The two-machine total completion time flow shop problem (Q1266536)
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 1208475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-machine total completion time flow shop problem |
scientific article; zbMATH DE number 1208475 |
Statements
The two-machine total completion time flow shop problem (English)
0 references
7 October 1998
0 references
neighborhood search
0 references
NP-hard scheduling
0 references
total completion time
0 references
two-machine flow shop
0 references
lower bounds
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0.9195394515991212
0 references
0.9083447456359864
0 references
0.908286988735199
0 references
0.9014921188354492
0 references
