Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (Q479220): 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: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6377197 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithms
Property / zbMATH Keywords: online algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
preemption-restart
Property / zbMATH Keywords: preemption-restart / rank
 
Normal rank
Property / zbMATH Keywords
 
incompatible families
Property / zbMATH Keywords: incompatible families / rank
 
Normal rank

Revision as of 19:49, 30 June 2023

scientific article
Language Label Description Also known as
English
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
scientific article

    Statements

    Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (English)
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    scheduling
    0 references
    online algorithms
    0 references
    preemption-restart
    0 references
    incompatible families
    0 references

    Identifiers