Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem (Q3659513)

From MaRDI portal
Revision as of 06:49, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
scientific article

    Statements

    Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem (English)
    0 references
    0 references
    0 references
    1983
    0 references
    NP-completeness
    0 references
    chance-constrained scheduling
    0 references
    random processing times
    0 references
    minimization of the number of tardy jobs
    0 references
    Balut's algorithm
    0 references
    n-job one- machine scheduling
    0 references

    Identifiers