Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278)

From MaRDI portal
Revision as of 02:54, 4 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
Scheduling \(UET\)-tasks on a star network: complexity and approximation
scientific article

    Statements

    title
    Scheduling \(UET\)-tasks on a star network: complexity and approximation (English)
    0 references
    author
    B. Valery
    0 references
    Rodolphe Giroudeau
    0 references
    Jean-Claude Konig
    0 references
    published in
    4OR
    0 references
    publication date
    25 May 2011
    0 references
    Mathematics Subject Classification ID
    68M20
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    5899499
    0 references
    zbMATH Keywords
    scheduling
    0 references
    non-approximability
    0 references
    approximation
    0 references
    OpenAlex ID
    W2076173115
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q538278&oldid=35228790"
    Powered by MediaWiki