GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Francisco J. Rodriguez / rank
Normal rank
 
Property / author
 
Property / author: Carlos García-Martínez / rank
Normal rank
 
Property / author
 
Property / author: Manuel Lozano / rank
Normal rank
 

Revision as of 05:35, 13 February 2024

scientific article
Language Label Description Also known as
English
GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
scientific article

    Statements

    GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (English)
    0 references
    0 references
    2 April 2013
    0 references
    0 references
    non-identical parallel machine scheduling problem with minimising total weighted completion times
    0 references
    metaheuristics
    0 references
    GRASP
    0 references
    path-relinking
    0 references