The two-machine total completion time flow shop problem (Q1266536)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-machine total completion time flow shop problem |
scientific article |
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
