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): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-012-9460-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036952194 / rank
 
Normal rank

Revision as of 19:49, 19 March 2024

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
    online scheduling
    0 references
    multipurpose machines
    0 references
    competitive analysis
    0 references
    makespan
    0 references
    algorithm \(TLS\)
    0 references

    Identifiers