A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179): 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: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6053922 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling single machine
Property / zbMATH Keywords: scheduling single machine / rank
 
Normal rank
Property / zbMATH Keywords
 
greedy randomized adaptive search procedure
Property / zbMATH Keywords: greedy randomized adaptive search procedure / rank
 
Normal rank
Property / zbMATH Keywords
 
differential evolution
Property / zbMATH Keywords: differential evolution / rank
 
Normal rank
Property / zbMATH Keywords
 
sequence-dependent setup times
Property / zbMATH Keywords: sequence-dependent setup times / rank
 
Normal rank
Property / zbMATH Keywords
 
total tardiness
Property / zbMATH Keywords: total tardiness / rank
 
Normal rank

Revision as of 23:35, 29 June 2023

scientific article
Language Label Description Also known as
English
A GRASP based on DE to solve single machine scheduling problem with SDST
scientific article

    Statements

    A GRASP based on DE to solve single machine scheduling problem with SDST (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    scheduling single machine
    0 references
    greedy randomized adaptive search procedure
    0 references
    differential evolution
    0 references
    sequence-dependent setup times
    0 references
    total tardiness
    0 references

    Identifiers