Pages that link to "Item:Q3792237"
From MaRDI portal
The following pages link to A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237):
Displaying 50 items.
- Vertex cover meets scheduling (Q270025) (← links)
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics (Q433416) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Improved approximation algorithms for scheduling parallel jobs on identical clusters (Q496005) (← links)
- Performance guarantees for scheduling algorithms under perturbed machine speeds (Q496438) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Linear time algorithms for parallel machine scheduling (Q856829) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- Feasibility of scheduling lot sizes of two frequencies on one machine (Q1331610) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources (Q1751153) (← links)
- An improved lower bound for rank four scheduling (Q1785250) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring (Q1928513) (← links)
- Approximability of scheduling with fixed jobs (Q1964484) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Partitioned EDF scheduling on a few types of unrelated multiprocessors (Q2251370) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q2309472) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
