Bounding strategies for the hybrid flow shop scheduling problem (Q545969): 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: 5912632 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
hybrid flow shop
Property / zbMATH Keywords: hybrid flow shop / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bounds
Property / zbMATH Keywords: lower bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank

Revision as of 12:26, 1 July 2023

scientific article
Language Label Description Also known as
English
Bounding strategies for the hybrid flow shop scheduling problem
scientific article

    Statements

    Bounding strategies for the hybrid flow shop scheduling problem (English)
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    0 references
    scheduling
    0 references
    hybrid flow shop
    0 references
    lower bounds
    0 references
    heuristics
    0 references