Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks (Q5949930)

From MaRDI portal
Revision as of 01:00, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 1678883
Language Label Description Also known as
English
Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
scientific article; zbMATH DE number 1678883

    Statements

    Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks (English)
    0 references
    0 references
    5 December 2001
    0 references
    semi on-line scheduling
    0 references
    partition
    0 references
    parallel processors
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references