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

From MaRDI portal
Revision as of 10:40, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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