An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling of independent jobs on a hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Parallel Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks on three dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems / 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 Jobs on Several Machines with the Job Splitting Property / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:04, 4 June 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
scientific article

    Statements

    An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (English)
    0 references
    0 references
    0 references
    25 July 2002
    0 references
    0 references
    nonpreemptive scheduling problem
    0 references
    hypercube parallel task systems
    0 references