A polynomial time algorithm for a chance-constrained single machine scheduling problem (Q1837104)

From MaRDI portal
Revision as of 05:57, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial time algorithm for a chance-constrained single machine scheduling problem
scientific article

    Statements

    A polynomial time algorithm for a chance-constrained single machine scheduling problem (English)
    0 references
    0 references
    0 references
    1983
    0 references
    chance-constrained sequencing problem
    0 references
    single machine
    0 references
    polynomial time algorithm
    0 references
    NP-hardness
    0 references

    Identifiers