Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893): 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: 6636225 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
uncertainty
Property / zbMATH Keywords: uncertainty / rank
 
Normal rank
Property / zbMATH Keywords
 
outsourcing
Property / zbMATH Keywords: outsourcing / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank

Revision as of 02:20, 28 June 2023

scientific article
Language Label Description Also known as
English
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
scientific article

    Statements

    Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    scheduling
    0 references
    uncertainty
    0 references
    outsourcing
    0 references
    computational complexity
    0 references

    Identifiers