A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343)

From MaRDI portal
Revision as of 23:58, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A best possible on-line algorithm for scheduling on uniform parallel-batch machines
scientific article

    Statements

    A best possible on-line algorithm for scheduling on uniform parallel-batch machines (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2018
    0 references
    online algorithm
    0 references
    uniform machines
    0 references
    parallel-batch machines
    0 references
    makespan
    0 references
    competitive ratio
    0 references

    Identifiers