Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (Q508765)

From MaRDI portal
Revision as of 14:35, 22 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
scientific article

    Statements

    title
    Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (English)
    0 references
    author
    Yong-Cai Geng
    0 references
    publication date
    8 February 2017
    0 references

    Identifiers

     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q508765&oldid=571011"
      Powered by MediaWiki