Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154)

From MaRDI portal
Revision as of 23:10, 26 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
Two branch-and-bound algorithms for the robust parallel machine scheduling problem
scientific article

    Statements

    Two branch-and-bound algorithms for the robust parallel machine scheduling problem (English)
    0 references
    0 references
    15 November 2012
    0 references
    robust scheduling
    0 references
    identical parallel machines
    0 references
    stochastic processing times
    0 references

    Identifiers