A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605)

From MaRDI portal
Revision as of 07:57, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A very fast TS/SA algorithm for the job shop scheduling problem
scientific article

    Statements

    title
    A very fast TS/SA algorithm for the job shop scheduling problem (English)
    0 references
    author
    Chaoyong Zhang
    0 references
    Peigen Li
    0 references
    Zailin Guan
    0 references
    Yun-Qing Rao
    0 references
    publication date
    10 October 2007
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90B40
    0 references
    90C59
    0 references
    zbMATH DE Number
    5199352
    0 references
    zbMATH Keywords
    Job shop scheduling problem
    0 references
    tabu search
    0 references
    simulated annealing
    0 references
    makespan
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2384605&oldid=26922619"
    Powered by MediaWiki