PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs with parallel nested machine processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task Scheduling on a Multiprocessor System with Independent Memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel machines with inclusive processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank

Latest revision as of 08:53, 2 July 2024

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