Pages that link to "Item:Q507314"
From MaRDI portal
The following pages link to Approximability of average completion time scheduling on unrelated machines (Q507314):
Displaying 6 items.
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (Q2884532) (← links)