Minimizing resource consumption on uniform parallel machines with a bound on makespan (Q336672): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650531 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
uniform parallel machine
Property / zbMATH Keywords: uniform parallel machine / rank
 
Normal rank
Property / zbMATH Keywords
 
makespan
Property / zbMATH Keywords: makespan / rank
 
Normal rank
Property / zbMATH Keywords
 
resource consumption
Property / zbMATH Keywords: resource consumption / rank
 
Normal rank

Revision as of 05:17, 28 June 2023

scientific article
Language Label Description Also known as
English
Minimizing resource consumption on uniform parallel machines with a bound on makespan
scientific article

    Statements

    Minimizing resource consumption on uniform parallel machines with a bound on makespan (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    scheduling
    0 references
    uniform parallel machine
    0 references
    makespan
    0 references
    resource consumption
    0 references

    Identifiers