On the complexity of minimizing the number of late jobs in unit time open shop (Q1962026)

From MaRDI portal
Revision as of 12:29, 29 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
On the complexity of minimizing the number of late jobs in unit time open shop
scientific article

    Statements

    title
    On the complexity of minimizing the number of late jobs in unit time open shop (English)
    0 references
    publication date
    30 January 2000
    0 references
    zbMATH DE Number
    1394996
    0 references
    zbMATH Keywords
    complexity
    0 references
    unit time open shop
    0 references
    unary NP-hard
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1962026&oldid=34234354"
    Powered by MediaWiki