The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions (Q3853421)

From MaRDI portal
Revision as of 21:49, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
scientific article

    Statements

    The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions (English)
    0 references
    0 references
    1979
    0 references
    two-machine maximum flow time problem
    0 references
    series-parallel precedence constraints
    0 references
    sequencing
    0 references
    polynomial algorithm
    0 references
    computational complexity
    0 references
    scheduling
    0 references

    Identifiers