Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem |
scientific article |
Statements
Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (English)
0 references
10 November 2016
0 references
machine scheduling
0 references
SAT
0 references
0 references
0 references
0 references
0 references
0 references
0 references
