Parallel variable neighbourhood search algorithms for job shop scheduling problems (Q5432691)

From MaRDI portal
Revision as of 16:59, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5221254
Language Label Description Also known as
English
Parallel variable neighbourhood search algorithms for job shop scheduling problems
scientific article; zbMATH DE number 5221254

    Statements

    title
    Parallel variable neighbourhood search algorithms for job shop scheduling problems (English)
    0 references
    author
    Mehmet Sevkli
    0 references
    M. Emin Aydin
    0 references
    publication date
    18 December 2007
    0 references
    zbMATH Keywords
    variable neighbourhood search
    0 references
    parallel neighbourhood search
    0 references
    job shop scheduling
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B35
    0 references
    68W10
    0 references
    90C59
    0 references
    zbMATH DE Number
    5221254
    0 references
    OpenAlex ID
    W2095820716
    0 references
    DOI
    10.1093/IMAMAN/DPM009
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5432691&oldid=39599211"
    Powered by MediaWiki