Strong NP-hardness of scheduling problems with learning or aging effect (Q363599): 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: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6203958 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
flowshop
Property / zbMATH Keywords: flowshop / rank
 
Normal rank
Property / zbMATH Keywords
 
single machine
Property / zbMATH Keywords: single machine / rank
 
Normal rank
Property / zbMATH Keywords
 
learning effect
Property / zbMATH Keywords: learning effect / rank
 
Normal rank
Property / zbMATH Keywords
 
aging effect
Property / zbMATH Keywords: aging effect / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank

Revision as of 12:10, 28 June 2023

scientific article
Language Label Description Also known as
English
Strong NP-hardness of scheduling problems with learning or aging effect
scientific article

    Statements

    Strong NP-hardness of scheduling problems with learning or aging effect (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2013
    0 references
    scheduling
    0 references
    flowshop
    0 references
    single machine
    0 references
    learning effect
    0 references
    aging effect
    0 references
    computational complexity
    0 references

    Identifiers