Pages that link to "Item:Q2845034"

The following pages link to Scheduling an interval ordered precedence graph with communication delays and a limited number of processors (Q2845034):

Displaying 9 items.

• Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
• Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays (Q1285544) (← links)
• Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
• An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors (Q1900934) (← links)
• The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
• Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650) (← links)
• Optimal schedules for d-D grid graphs with communication delays (Q4593968) (← links)
• Scheduling interval ordered tasks with non-uniform deadlines (Q6487456) (← links)