Applying tabu search to the job-shop scheduling problem (Q2367003)

From MaRDI portal
Revision as of 09:04, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/anor/DellAmicoT93, #quickstatements; #temporary_batch_1731483406851)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Applying tabu search to the job-shop scheduling problem
scientific article

    Statements

    title
    Applying tabu search to the job-shop scheduling problem (English)
    0 references
    author
    Mauro Dell'Amico
    0 references
    Marco Trubian
    0 references
    publication date
    16 August 1993
    0 references
    zbMATH Keywords
    tabu search
    0 references
    job-shop scheduling
    0 references

    Identifiers

    DOI
    10.1007/BF02023076
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90-08
    0 references
    90C27
    0 references
    zbMATH DE Number
    232542
    0 references
    Wikidata QID
    Q59222321
    0 references
    OpenAlex ID
    W1971338172
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2367003&oldid=37901045"
    Powered by MediaWiki