On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887)

From MaRDI portal
Revision as of 18:05, 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
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
scientific article

    Statements

    On the geometry, preemptions and complexity of multiprocessor and shop scheduling (English)
    0 references
    0 references
    0 references
    3 September 2008
    0 references
    0 references
    algorithm
    0 references
    shop scheduling
    0 references
    multiprocessor scheduling
    0 references
    time complexity
    0 references
    preemption
    0 references