New heuristics for flow shop problem to minimize makespan (Q4933629)
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: New heuristics for flow shop problem to minimize makespan |
scientific article; zbMATH DE number 5799622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New heuristics for flow shop problem to minimize makespan |
scientific article; zbMATH DE number 5799622 |
Statements
New heuristics for flow shop problem to minimize makespan (English)
0 references
14 October 2010
0 references
scheduling
0 references
flow shop problem
0 references
makespan
0 references
performance analysis of algorithm
0 references
0.8385765552520752
0 references
0.8374682068824768
0 references
0.8359012007713318
0 references
0.8318415880203247
0 references
