Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (Q6039898): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 16:14, 25 April 2024

scientific article; zbMATH DE number 7688227
Language Label Description Also known as
English
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
scientific article; zbMATH DE number 7688227

    Statements

    Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2023
    0 references
    streaming algorithms
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    total completion time
    0 references
    varying processing capacity
    0 references

    Identifiers