PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542)

From MaRDI portal
Revision as of 14:58, 17 October 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
PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION
scientific article

    Statements

    PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (English)
    0 references
    0 references
    0 references
    0 references
    8 January 2010
    0 references
    0 references
    preemptive scheduling
    0 references
    nested processing set
    0 references
    inclusive processing set
    0 references
    makespan minimization
    0 references
    polynomial-time algorithms
    0 references