Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794)
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 5324085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of single machine scheduling problems under scenario-based uncertainty |
scientific article; zbMATH DE number 5324085 |
Statements
Complexity of single machine scheduling problems under scenario-based uncertainty (English)
0 references
10 September 2008
0 references
scheduling
0 references
scenario-based uncertainty
0 references
absolute robustness
0 references
0 references
0 references
0 references
0.8728792667388916
0 references
0.8720691204071045
0 references
0.850631058216095
0 references
0.8498591780662537
0 references
0.8384842276573181
0 references
