Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Sumit K. Garg / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5886218 / rank
 
Normal rank
Property / zbMATH Keywords
 
online scheduling
Property / zbMATH Keywords: online scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel-batch machines
Property / zbMATH Keywords: parallel-batch machines / rank
 
Normal rank
Property / zbMATH Keywords
 
incompatible job families
Property / zbMATH Keywords: incompatible job families / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive ratio
Property / zbMATH Keywords: competitive ratio / rank
 
Normal rank

Revision as of 09:32, 1 July 2023

scientific article
Language Label Description Also known as
English
Online scheduling on unbounded parallel-batch machines with incompatible job families
scientific article

    Statements

    Online scheduling on unbounded parallel-batch machines with incompatible job families (English)
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    online scheduling
    0 references
    parallel-batch machines
    0 references
    incompatible job families
    0 references
    competitive ratio
    0 references