A unified framework for designing EPTAS for load balancing on parallel machines
From MaRDI portal
(Redirected from Publication:2415372)
Recommendations
Cites work
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- A PTAS for scheduling unrelated machines of few different types
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Approximation schemes for scheduling on parallel machines
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 6820261 (Why is no real title available?)
- scientific article; zbMATH DE number 6297793 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Multiprocessor Scheduling with Rejection
- On the efficiency of polynomial time approximation schemes
- On the optimality of exact and approximation algorithms for scheduling problems
- Parametrized complexity theory.
- Partitioned EDF scheduling on a few types of unrelated multiprocessors
- Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Cited in
(23)- A unified framework for designing EPTAS's for load balancing on parallel machines
- Approximation algorithms for the multiprocessor scheduling with submodular penalties
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
- Fair and efficient allocation with few agent types, few item types, or small value levels
- A highly OR-parallel inference machine (Multi-ASCA) and its performance evaluation: an architecture and its load balancing algorithms
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- EPTAS for parallel identical machine scheduling with time restrictions
- Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
- Approximation scheme for single-machine rescheduling with job delay and rejection
- Bag-of-tasks scheduling with rejection in large computing systems
- Approximation algorithms for job scheduling with block-type conflict graphs
- The prize-collecting single machine scheduling with bounds and penalties
- Bilevel adversarial scheduling problem on parallel machines
- Approximation algorithms for the combination of prize-collecting vertex cover and scheduling
- An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines
- An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines
- An efficient polynomial time approximation scheme for minimizing the total weighted completion time on uniformly related machines
- Approximation algorithms for scheduling with rejection in Green manufacturing
- Exact and approximate algorithms for high-multiplicity scheduling with rejection on parallel machines
This page was built for publication: A unified framework for designing EPTAS for load balancing on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415372)
