Upper bound of the duration of the shortest schedule in one class of Hu problems (Q3902465)

From MaRDI portal
Revision as of 21:25, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Upper bound of the duration of the shortest schedule in one class of Hu problems
scientific article

    Statements

    title
    Upper bound of the duration of the shortest schedule in one class of Hu problems (English)
    0 references
    DOI
    10.1007/BF01075108
    0 references
    author
    A. I. Kuksa
    0 references
    published in
    Cybernetics
    0 references
    publication date
    1979
    0 references
    Mathematics Subject Classification ID
    68M20
    0 references
    68R10
    0 references
    68Q25
    0 references
    zbMATH DE Number
    3711350
    0 references
    zbMATH Keywords
    scheduling
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3902465&oldid=17554795"
    Powered by MediaWiki