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

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1278535
Property / author
 
Property / author: Hiroshi Kise / rank
Normal rank
 

Revision as of 15:14, 28 February 2024

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
    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