An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines (Q596461)

From MaRDI portal
Revision as of 03:55, 11 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines
scientific article

    Statements

    An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2004
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    precedence constraints
    0 references
    preemptable tasks
    0 references

    Identifiers