The time dependent machine makespan problem is strongly NP-complete (Q1304510)

From MaRDI portal
Revision as of 12:16, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The time dependent machine makespan problem is strongly NP-complete
scientific article

    Statements

    title
    The time dependent machine makespan problem is strongly NP-complete (English)
    0 references
    author
    Cheng, T. C. Edwin
    0 references
    Qing Ding
    0 references
    publication date
    22 September 1999
    0 references
    zbMATH DE Number
    1339938
    0 references
    zbMATH Keywords
    sequencing
    0 references
    time dependence
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1304510&oldid=13415388"
    Powered by MediaWiki