The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations (Q3863680)

From MaRDI portal
Revision as of 01:18, 20 October 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 Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
scientific article

    Statements

    The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations (English)
    0 references
    0 references
    1979
    0 references
    two-machine maximum flow time problem
    0 references
    series parallel precedence relations
    0 references
    polynomial bounded optimal algorithm
    0 references
    minimization of makespan
    0 references

    Identifiers