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

From MaRDI portal
Revision as of 11:37, 13 June 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
Upper bound of the duration of the shortest schedule in one class of Hu problems
scientific article

    Statements

    Upper bound of the duration of the shortest schedule in one class of Hu problems (English)
    0 references
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references