EPTAS for load balancing problem on parallel machines with a non-renewable resource
type: Item
instance of: scholarly article
title: EPTAS for load balancing problem on parallel machines with a non-renewable resource
DOI: 10.1007/978-3-030-92702-8_7
author: G. Jaykrishnan
author: Asaf Levin
publication date: 2022-10-19T00:00:00Z
full work available at URL: https://arxiv.org/abs/2108.04071
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7603887
zbMATH Keywords: scheduling
zbMATH Keywords: approximation algorithms
zbMATH Keywords: EPTAS
MaRDI profile type: Publication
OpenAlex ID: W4285531112
cites work: Approximation schemes for scheduling on parallel machines
cites work: Scheduling with non-renewable resources: minimizing the sum of completion times
cites work: Scheduling subject to nonrenewable-resource constraints
cites work: On the efficiency of polynomial time approximation schemes
cites work: Q4503944
cites work: An efficient polynomial time approximation scheme for load balancing on uniformly related machines
cites work: Q4736854
cites work: Basic scheduling problems with raw material constraints
cites work: Approximation schemes for parallel machine scheduling with non-renewable resources
cites work: Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
cites work: A PTAS for a resource scheduling problem with arbitrary number of parallel machines
cites work: Approximation schemes for single machine scheduling with non-renewable resource constraints
cites work: Approximability of scheduling problems with resource consuming jobs
cites work: Reductions between scheduling problems with non-renewable resources and knapsack problems
cites work: Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
cites work: An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
cites work: Closing the Gap for Makespan Scheduling via Sparsification Techniques
cites work: Approximability of total weighted completion time with resource consuming jobs
cites work: A unified framework for designing EPTAS for load balancing on parallel machines
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Integer Programming with a Fixed Number of Variables
cites work: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
description: scientific article; zbMATH DE number 7603887