Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (Q363579): 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: 90B30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6203947 / rank
 
Normal rank
Property / zbMATH Keywords
 
resource-sharing and scheduling problem
Property / zbMATH Keywords: resource-sharing and scheduling problem / rank
 
Normal rank
Property / zbMATH Keywords
 
resource constrained scheduling problem
Property / zbMATH Keywords: resource constrained scheduling problem / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed integer linear programming
Property / zbMATH Keywords: mixed integer linear programming / rank
 
Normal rank
Property / zbMATH Keywords
 
branch and bound algorithm
Property / zbMATH Keywords: branch and bound algorithm / rank
 
Normal rank

Revision as of 12:09, 28 June 2023

scientific article
Language Label Description Also known as
English
Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
scientific article

    Statements

    Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    resource-sharing and scheduling problem
    0 references
    resource constrained scheduling problem
    0 references
    mixed integer linear programming
    0 references
    branch and bound algorithm
    0 references