Pages that link to "Item:Q935152"
From MaRDI portal
The following pages link to Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152):
Displaying 15 items.
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Scheduling tasks with small communication delays for clusters of processors (Q596450) (← links)
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411) (← links)
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- Scheduling series-parallel orders subject to 0/1-communication delays (Q1285545) (← links)
- Scheduling series--parallel orders subject to 0/1-communication delays (Q1292209) (← 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)
- A very difficult scheduling problem with communication delays (Q1604057) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications (Q1853631) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- Open Problem—M/G/1 Scheduling with Preemption Delays (Q5113909) (← links)
- Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
