Minimizing completion time for a class of scheduling problems (Q794156)

From MaRDI portal
Revision as of 19:02, 5 July 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
Minimizing completion time for a class of scheduling problems
scientific article

    Statements

    Minimizing completion time for a class of scheduling problems (English)
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    job scheduling
    0 references
    weighted linear scheduling problems
    0 references
    precedence constraints
    0 references
    greedy algorithm
    0 references
    setup minimization problem for N-free ordered sets
    0 references