Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808)

From MaRDI portal
Revision as of 16:44, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms with limited number of preemptions for scheduling on parallel machines
scientific article

    Statements

    Algorithms with limited number of preemptions for scheduling on parallel machines (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2014
    0 references
    0 references
    \(i\)-preemptive scheduling
    0 references
    approximation algorithm
    0 references
    worst case ratio
    0 references
    makespan
    0 references
    0 references