Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness (Q4181574)

From MaRDI portal
Revision as of 21:37, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3617875
Language Label Description Also known as
English
Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
scientific article; zbMATH DE number 3617875

    Statements

    Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness (English)
    0 references
    0 references
    0 references
    0 references
    1977
    0 references
    Makespan
    0 references
    Scheduling
    0 references
    Treelike Precedence Constraints
    0 references
    Minimization Of Maximal Lateness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references