Risk-averse single machine scheduling: complexity and approximation (Q2286434)
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 7155041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Risk-averse single machine scheduling: complexity and approximation |
scientific article; zbMATH DE number 7155041 |
Statements
Risk-averse single machine scheduling: complexity and approximation (English)
0 references
22 January 2020
0 references
single machine
0 references
value-at-risk
0 references
conditional value-at-risk
0 references
computational complexity
0 references
approximation algorithms
0 references
robust scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9345501065254213
0 references
0.8720691204071045
0 references
0.8531343936920166
0 references
0.8371030688285828
0 references
0.819897472858429
0 references
