Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529)

From MaRDI portal
Revision as of 14:49, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Ant colony optimization combined with taboo search for the job shop scheduling problem
scientific article

    Statements

    title
    Ant colony optimization combined with taboo search for the job shop scheduling problem (English)
    0 references
    author
    Kuo-Ling Huang
    0 references
    Ching-Jong Liao
    0 references
    publication date
    1 September 2008
    0 references
    zbMATH Keywords
    makespan
    0 references
    describes a project that uses
    Beam-ACO
    0 references
    JOBSHOP
    0 references
    cites work
    Q4198056
    0 references
    Q5692627
    0 references
    Q4350051
    0 references
    Q5480099
    0 references
    Q4319398
    0 references
    Q2776548
    0 references
    Tabu Search—Part I
    0 references
    Tabu Search—Part II
    0 references

    Identifiers

    zbMATH DE Number
    5318736
    0 references
    OpenAlex ID
    W2011649121
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q941529&oldid=35069628"
    Powered by MediaWiki