An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines (Q2775886)

From MaRDI portal
Revision as of 00:50, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
scientific article

    Statements

    title
    An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines (English)
    0 references
    author
    Chandra Chekuri
    0 references
    Michael A. Bender
    0 references
    publication date
    8 July 2002
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    68M20
    0 references
    90B35
    0 references
    zbMATH DE Number
    1714184
    0 references
    zbMATH Keywords
    scheduling
    0 references
    OpenAlex ID
    W2012989825
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2775886&oldid=32463155"
    Powered by MediaWiki