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

From MaRDI portal
Revision as of 20:07, 30 August 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
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