Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268)
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: Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem |
scientific article; zbMATH DE number 6650768
| 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; zbMATH DE number 6650768 |
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
0.8949647
0 references
0.8949125
0 references
0.88733387
0 references
0.88420737
0 references
0 references
0.8789212
0 references
0.87768894
0 references
