Pages that link to "Item:Q2775886"
From MaRDI portal
The following pages link to An efficient approximation algorithm for minimizing makespan on uniformly related machines. (Q2775886):
Displaying 16 items.
- Decentralized list scheduling (Q367649) (← links)
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- An improved monotone algorithm for scheduling related machines with precedence constraints (Q408428) (← links)
- Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics (Q433416) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- Scheduling algorithms for procrastinators (Q835586) (← links)
- Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search (Q868140) (← links)
- Speed scaling of tasks with precedence constraints (Q927406) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Power-aware scheduling for makespan and flow (Q1041350) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions (Q3163694) (← links)
- Towards Tight Lower Bounds for Scheduling Problems (Q3452775) (← links)
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds (Q4238532) (← links)
- APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS (Q5187850) (← links)
- Related machine scheduling with machine speeds satisfying linear constraints (Q5918518) (← links)
