A Decomposition Algorithm for Sequencing with General Precedence Constraints (Q3962769)

From MaRDI portal
Revision as of 18:20, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Decomposition Algorithm for Sequencing with General Precedence Constraints
scientific article

    Statements

    A Decomposition Algorithm for Sequencing with General Precedence Constraints (English)
    0 references
    0 references
    1981
    0 references
    unconstrained job sequencing
    0 references
    adjacent job interchange property
    0 references
    adjacent sequence interchange property
    0 references
    existence of decomposition algorithms
    0 references
    general precedence structures
    0 references
    two-machine maximum flow time problem
    0 references
    maximum cumulative cost problem
    0 references
    least cost fault detection problem
    0 references
    total weighted exponential completion time problem
    0 references
    sufficient condition for the existence of efficient algorithms
    0 references
    series-parallel precedence constraints
    0 references

    Identifiers