Risk-averse single machine scheduling: complexity and approximation (Q2286434)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Risk-averse single machine scheduling: complexity and approximation
scientific article

    Statements

    Risk-averse single machine scheduling: complexity and approximation (English)
    0 references
    0 references
    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 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references