The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (Q3111147)

From MaRDI portal
Revision as of 22:50, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
scientific article

    Statements

    The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    makespan
    0 references
    uncertainty
    0 references
    dominance relation
    0 references
    0 references