An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (Q4812724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 02:18, 8 February 2024

scientific article; zbMATH DE number 2094338
Language Label Description Also known as
English
An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion
scientific article; zbMATH DE number 2094338

    Statements

    An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (English)
    0 references
    0 references
    23 August 2004
    0 references
    0 references
    minimum makespan criterion
    0 references