EPTAS for parallel identical machine scheduling with time restrictions
From MaRDI portal
Publication:6123390
DOI10.1007/s10878-024-01108-yarXiv2111.06692OpenAlexW4392078257MaRDI QIDQ6123390
Publication date: 4 March 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.06692
Cites Work
- Unnamed Item
- Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
- On the efficiency of polynomial time approximation schemes
- A 3/2-approximation algorithm for \(k_i\)-partitioning
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Single-processor scheduling with time restrictions
- Better permutations for the single-processor scheduling with time restrictions
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem
- Approximation schemes for scheduling on parallel machines
- On the NP-hardness of scheduling with time restrictions
- \(\kappa\)-partitioning problems for maximizing the minimum load
- Optimal matroid partitioning problems
- The single-processor scheduling problem with time restrictions: complexity and related problems
- A unified framework for designing EPTAS for load balancing on parallel machines
- Parametrized complexity theory.
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints
- Integer Programming with a Fixed Number of Variables
- Closing the Gap for Makespan Scheduling via Sparsification Techniques
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
- An EPTAS for scheduling on unrelated machines of few different types
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
This page was built for publication: EPTAS for parallel identical machine scheduling with time restrictions
