The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470)

From MaRDI portal
Revision as of 13:49, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127883981, #quickstatements; #temporary_batch_1722343634948)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
scientific article

    Statements

    title
    The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (English)
    0 references
    author
    Soo Y. Chang
    0 references
    Hark-Chin Hwang
    0 references
    publication date
    7 February 2000
    0 references
    zbMATH Keywords
    nonsimultaneous multiprocessor scheduling problem
    0 references

    Identifiers

    zbMATH DE Number
    1339913
    0 references
    Wikidata QID
    Q127883981
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1304470&oldid=37446700"
    Powered by MediaWiki