Pages that link to "Item:Q880503"
From MaRDI portal
The following pages link to Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503):
Displaying 11 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)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686) (← links)
- Approximation algorithms for scheduling with a limited number of communications (Q1575597) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- Approximation algorithms for UET scheduling problems with exact delays (Q2457273) (← links)
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)
- On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (Q3148374) (← links)
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times (Q6179222) (← links)
