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 4 items.
- 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 the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times (Q6179222) (← links)
