An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488): 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.1016/j.disopt.2012.07.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049627958 / rank
 
Normal rank

Revision as of 02:39, 20 March 2024

scientific article
Language Label Description Also known as
English
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
scientific article

    Statements

    An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (English)
    0 references
    0 references
    0 references
    28 December 2012
    0 references
    multipurpose machine scheduling
    0 references
    online scheduling
    0 references
    total completion time
    0 references
    competitive ratio
    0 references

    Identifiers