Reducibility among single machine weighted completion time scheduling problems (Q922287)

From MaRDI portal
Revision as of 12:13, 7 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
Reducibility among single machine weighted completion time scheduling problems
scientific article

    Statements

    Reducibility among single machine weighted completion time scheduling problems (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    sum of weighted completion time problems
    0 references
    release date
    0 references
    deadline
    0 references
    continuous machine processing
    0 references