A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:53, 5 March 2024

scientific article
Language Label Description Also known as
English
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
scientific article

    Statements

    A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (English)
    0 references
    0 references
    16 January 2012
    0 references
    parallel-batch scheduling
    0 references
    online algorithm
    0 references
    restart
    0 references
    competitive ratio
    0 references

    Identifiers