EPTAS for load balancing problem on parallel machines with a non-renewable resource

DOI10.1007/978-3-030-92702-8_7MaRDI QIDQ2085740zbMATH OpenOpenAlexFDO

Authors G. Jaykrishnan, Asaf Levin

Publication date 19 October 2022

Full work available at URL https://arxiv.org/abs/2108.04071

zbMATH Keywords

approximation algorithmsEPTASscheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites work

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• A PTAS for a resource scheduling problem with arbitrary number of parallel machines
• A unified framework for designing EPTAS for load balancing on parallel machines
• 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
• Approximability of scheduling problems with resource consuming jobs
• Approximability of total weighted completion time with resource consuming jobs
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation schemes for parallel machine scheduling with non-renewable resources
• Approximation schemes for scheduling on parallel machines
• Approximation schemes for single machine scheduling with non-renewable resource constraints
• Basic scheduling problems with raw material constraints
• Closing the gap for makespan scheduling via sparsification techniques
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 2086399 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
• On the efficiency of polynomial time approximation schemes
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Reductions between scheduling problems with non-renewable resources and knapsack problems
• Scheduling subject to nonrenewable-resource constraints
• Scheduling with non-renewable resources: minimizing the sum of completion times

Cited in

(2)

• A unified framework for designing EPTAS's for load balancing on parallel machines
• EPTAS for load balancing problem on parallel machines with a non-renewable resource

This page was built for publication: EPTAS for load balancing problem on parallel machines with a non-renewable resource

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2085740)