Pages that link to "Item:Q1894375"
From MaRDI portal
The following pages link to New complexity results on scheduling with small communication delays (Q1894375):
Displaying 11 items.
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- Task scheduling with interprocessor communication delays (Q1197669) (← links)
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- Using duplication for scheduling unitary tasks on m processors with unit communication delays (Q1391530) (← links)
- Approximation algorithms for scheduling with a limited number of communications (Q1575597) (← links)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
- Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
- A Heuristic for a Scheduling Problem with Communication Delays (Q4367272) (← links)
- The complexity of scheduling problems with communication delays for trees (Q5056138) (← links)
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays (Q5929309) (← links)