Open shop scheduling problems with conflict graphs (Q2357137)

From MaRDI portal
Revision as of 23:38, 13 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
Open shop scheduling problems with conflict graphs
scientific article

    Statements

    title
    Open shop scheduling problems with conflict graphs (English)
    0 references
    author
    Mourad Boudhar
    0 references
    Nour El Houda Tellache
    0 references
    publication date
    19 June 2017
    0 references
    zbMATH Keywords
    open shop scheduling
    0 references
    conflict graphs
    0 references
    complexity
    0 references
    heuristics
    0 references
    lower bounds
    0 references
    makespan
    0 references
    cites work
    Q3821925
    0 references
    Q3267900
    0 references
    Q4198056
    0 references
    Scheduling
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B35
    0 references
    68M20
    0 references
    68R10
    0 references
    zbMATH DE Number
    6732294
    0 references
    OpenAlex ID
    W2620006440
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2357137&oldid=36328579"
    Powered by MediaWiki