Approximation algorithms for the parallel flow shop problem (Q421785)
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 6035167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the parallel flow shop problem |
scientific article; zbMATH DE number 6035167 |
Statements
Approximation algorithms for the parallel flow shop problem (English)
0 references
14 May 2012
0 references
scheduling
0 references
parallel flow shop
0 references
hybrid flow shop
0 references
approximation algorithms
0 references
worst-case analysis
0 references
0 references
0.8947572708129883
0 references
0.893839955329895
0 references
0.8914127945899963
0 references
0.890616774559021
0 references
0.8873046636581421
0 references
