Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266)
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 2201638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some local search algorithms for no-wait flow-shop problem with makespan criterion |
scientific article; zbMATH DE number 2201638 |
Statements
Some local search algorithms for no-wait flow-shop problem with makespan criterion (English)
0 references
2 September 2005
0 references
Flow-shop scheduling
0 references
No-wait
0 references
Makespan
0 references
Local search
0 references
Tabu search
0 references
Empirical evaluation
0 references
0 references
0 references
0 references
0 references
0 references
0.8250345587730408
0 references
0.8140241503715515
0 references
0.8140241503715515
0 references
0.798772394657135
0 references
0.7949906587600708
0 references
