Tight bounds for the identical parallel machine scheduling problem (Q3429035)
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 5139059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for the identical parallel machine scheduling problem |
scientific article; zbMATH DE number 5139059 |
Statements
Tight bounds for the identical parallel machine scheduling problem (English)
0 references
30 March 2007
0 references
0 references
0 references
0.926089346408844
0 references
0.8669966459274292
0 references
0.8495923280715942
0 references
0.8456500768661499
0 references
0.8452120423316956
0 references
