The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898)

From MaRDI portal
Revision as of 12:35, 21 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
scientific article

    Statements

    title
    The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (English)
    0 references
    author
    Radosław Rudek
    0 references
    publication date
    18 May 2012
    0 references

    Identifiers

     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q422898&oldid=485011"
      Powered by MediaWiki