Approximation algorithms for parallel machine scheduling with linear deterioration (Q391224): 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: 68W25 / 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: 6244097 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel machine
Property / zbMATH Keywords: parallel machine / rank
 
Normal rank
Property / zbMATH Keywords
 
simple linear deterioration
Property / zbMATH Keywords: simple linear deterioration / rank
 
Normal rank
Property / zbMATH Keywords
 
makespan
Property / zbMATH Keywords: makespan / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank

Revision as of 14:09, 29 June 2023

scientific article
Language Label Description Also known as
English
Approximation algorithms for parallel machine scheduling with linear deterioration
scientific article

    Statements

    Approximation algorithms for parallel machine scheduling with linear deterioration (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    scheduling
    0 references
    parallel machine
    0 references
    simple linear deterioration
    0 references
    makespan
    0 references
    approximation algorithm
    0 references

    Identifiers