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 4 items.
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
