New hard benchmark for flowshop scheduling problems minimising makespan (Q300036)
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 hard benchmark for flowshop scheduling problems minimising makespan |
scientific article; zbMATH DE number 6597114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New hard benchmark for flowshop scheduling problems minimising makespan |
scientific article; zbMATH DE number 6597114 |
Statements
New hard benchmark for flowshop scheduling problems minimising makespan (English)
0 references
23 June 2016
0 references
flowshop
0 references
makespan
0 references
benchmark
0 references
0 references
0 references
0 references
0 references
0 references
0.8267486691474915
0 references
0.8220036625862122
0 references
0.8093847632408142
0 references
0.7952625751495361
0 references
