Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998)

From MaRDI portal
Revision as of 06:47, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
scientific article

    Statements

    Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2015
    0 references
    online scheduling
    0 references
    hierarchy
    0 references
    competitive ratio
    0 references

    Identifiers