Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212)

From MaRDI portal
Revision as of 23:17, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
scientific article

    Statements

    Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (English)
    0 references
    0 references
    0 references
    0 references
    24 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    semi-online scheduling
    0 references
    uniform machines
    0 references
    competitive analysis
    0 references
    0 references