Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211)

From MaRDI portal
Revision as of 18:05, 4 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
Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
scientific article

    Statements

    Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (English)
    0 references
    0 references
    0 references
    30 April 2014
    0 references
    0 references
    parallel machine scheduling
    0 references
    complexity
    0 references
    assembly line balancing
    0 references