A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650625 / rank
 
Normal rank
Property / zbMATH Keywords
 
online scheduling
Property / zbMATH Keywords: online scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel machine
Property / zbMATH Keywords: parallel machine / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive ratio
Property / zbMATH Keywords: competitive ratio / rank
 
Normal rank
Property / zbMATH Keywords
 
total weighted completion time
Property / zbMATH Keywords: total weighted completion time / rank
 
Normal rank
Property / zbMATH Keywords
 
instance reduction
Property / zbMATH Keywords: instance reduction / rank
 
Normal rank

Revision as of 05:20, 28 June 2023

scientific article
Language Label Description Also known as
English
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
scientific article

    Statements

    A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (English)
    0 references
    0 references
    10 November 2016
    0 references
    online scheduling
    0 references
    parallel machine
    0 references
    competitive ratio
    0 references
    total weighted completion time
    0 references
    instance reduction
    0 references

    Identifiers