A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876)

From MaRDI portal
Revision as of 15:19, 28 December 2023 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57634009, #quickstatements; #temporary_batch_1703769339033)
scientific article
Language Label Description Also known as
English
A polynomial algorithm for an open shop problem with unit processing times and tree constraints
scientific article

    Statements

    A polynomial algorithm for an open shop problem with unit processing times and tree constraints (English)
    0 references
    0 references
    0 references
    0 references
    17 May 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    open shop problem
    0 references
    unit processing times
    0 references
    tree constraints
    0 references
    polynomial algorithm
    0 references
    0 references