Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647)

From MaRDI portal
Revision as of 18:10, 27 May 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
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
scientific article

    Statements

    title
    Exact and approximation algorithms for makespan minimization on unrelated parallel machines (English)
    0 references
    author
    Silvano Martello
    0 references
    François Soumis
    0 references
    Paolo Toth
    0 references
    publication date
    10 August 1997
    0 references
    zbMATH DE Number
    1047040
    0 references
    zbMATH Keywords
    NP-hard problem
    0 references
    scheduling
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1363647&oldid=34186348"
    Powered by MediaWiki