Pages that link to "Item:Q2464419"
From MaRDI portal
The following pages link to Approximation algorithms for average stretch scheduling (Q2464419):
Displaying 10 items.
- Scheduling algorithms for procrastinators (Q835586) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- Improved lower bounds for online scheduling to minimize total stretch (Q1680548) (← links)
- Average stretch without migration (Q1878679) (← links)
- (Q2762528) (← links)
- From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
- The Complexity of Scheduling for p-Norms of Flow and Stretch (Q4910823) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)
- (Q5743474) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)