A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths (Q2757667)

From MaRDI portal
Revision as of 05:18, 16 August 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
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
scientific article

    Statements

    A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths (English)
    0 references
    0 references
    0 references
    0 references
    26 November 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    Parallel machine scheduling, high-multiplicity scheduling, polynomial algorithms, bin packing, cutting stock, Hilbert basis, integer roundup property, integer decomposition property
    0 references