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

From MaRDI portal
Revision as of 10:08, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    publication date
    22 September 1999
    0 references
    zbMATH Keywords
    sequencing
    0 references
    time dependence
    0 references
    author
    Cheng, T. C. Edwin
    0 references
    Qing Ding
    0 references

    Identifiers

    zbMATH DE Number
    1339938
    0 references
    OpenAlex ID
    W2022314204
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1304510&oldid=37220512"
    Powered by MediaWiki