Pages that link to "Item:Q1853631"
From MaRDI portal
The following pages link to An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications (Q1853631):
Displaying 6 items.
- Scheduling tasks with small communication delays for clusters of processors (Q596450) (← links)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal (Q955345) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- Approximation algorithms for scheduling with a limited number of communications (Q1575597) (← links)
- General scheduling non-approximability results in presence of hierarchical communications (Q2384613) (← links)