Pages that link to "Item:Q1592284"
From MaRDI portal
The following pages link to A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284):
Displaying 14 items.
- A survey on offline scheduling with rejection (Q398830) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria (Q826114) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (Q2884532) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855) (← links)
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs (Q6565429) (← links)
