On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659)

From MaRDI portal
Revision as of 20:49, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
scientific article

    Statements

    On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (English)
    0 references
    0 references
    0 references
    9 August 2013
    0 references
    0 references
    online scheduling
    0 references
    multipurpose machines
    0 references
    competitive analysis
    0 references
    makespan
    0 references
    algorithm \(TLS\)
    0 references
    0 references