Complexity of Scheduling Parallel Task Systems (Q3832306)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of Scheduling Parallel Task Systems
scientific article

    Statements

    Complexity of Scheduling Parallel Task Systems (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithms
    0 references
    Parallel Task System
    0 references
    schedule length
    0 references
    nonpreemptive scheduling
    0 references
    strongly NP-hard
    0 references
    pseudo-polynomial time
    0 references
    0 references