A tabu search algorithm for the open shop problem (Q1383321)
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: A tabu search algorithm for the open shop problem |
scientific article; zbMATH DE number 1139356
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tabu search algorithm for the open shop problem |
scientific article; zbMATH DE number 1139356 |
Statements
A tabu search algorithm for the open shop problem (English)
0 references
11 June 1998
0 references
sequencing
0 references
minimum makespan open shop problem without preemption
0 references
arbitrary number of machines
0 references
tabu search
0 references
0.9777046
0 references
0.90792704
0 references
0.9030309
0 references
0.8964329
0 references
0.8959439
0 references
0.89231294
0 references
0.8837864
0 references
0.88207906
0 references
0.88159853
0 references
