A special case of the single-machine total tardiness problem is NP-hard (Q1946412)

From MaRDI portal
Revision as of 09:44, 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
A special case of the single-machine total tardiness problem is NP-hard
scientific article

    Statements

    title
    A special case of the single-machine total tardiness problem is NP-hard (English)
    0 references
    publication date
    12 April 2013
    0 references
    author
    Evgeny R. Gafarov
    0 references
    Alexander A. Lazarev
    0 references

    Identifiers

    zbMATH DE Number
    6153775
    0 references
    OpenAlex ID
    W2621839118
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1946412&oldid=37139976"
    Powered by MediaWiki