Pages that link to "Item:Q1278302"
From MaRDI portal
The following pages link to On the complexity of scheduling with large communication delays (Q1278302):
Displaying 5 items.
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
- Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
