Flow shop scheduling problem with conflict graphs (Q1708533)

From MaRDI portal
Revision as of 08:19, 15 July 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
Flow shop scheduling problem with conflict graphs
scientific article

    Statements

    title
    Flow shop scheduling problem with conflict graphs (English)
    0 references
    author
    Nour El Houda Tellache
    0 references
    Mourad Boudhar
    0 references
    publication date
    23 March 2018
    0 references
    zbMATH Keywords
    scheduling
    0 references
    flow-shop
    0 references
    conflict graph
    0 references
    complexity
    0 references
    heuristics
    0 references
    cites work
    Q3821925
    0 references
    Q3470246
    0 references
    Q3267900
    0 references
    Q4198056
    0 references

    Identifiers

    zbMATH DE Number
    6852534
    0 references
    OpenAlex ID
    W2631032937
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1708533&oldid=36380266"
    Powered by MediaWiki