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

08/09/2021
by   G. Jaykrishnan, et al.
0

The problem considered is the non-preemptive scheduling of independent jobs that consume a resource (which is non-renewable and replenished regularly) on parallel uniformly related machines. The input defines the speed of machines, size of jobs, the quantity of resource required by the jobs, the replenished quantities, and replenishment dates of the resource. Every job can start processing only after the required quantity of the resource is allocated to the job. The objective function is the minimization of the convex combination of the makespan and an objective that is equivalent to the l_p-norm of the vector of loads of the machines. We present an EPTAS for this problem. Prior to our work only a PTAS was known in this non-renewable resource settings and this PTAS was only for the special case of our problem of makespan minimization on identical machines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2018

Parallel Machine Scheduling with a Single Resource per Job

We study the problem of scheduling jobs on parallel machines minimizing ...
research
11/12/2021

EPTAS for parallel identical machine scheduling with time restrictions

We consider the non-preemptive scheduling problem on identical machines ...
research
09/24/2019

A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs

We study the approximability of two related machine scheduling problems....
research
04/21/2019

Scheduling to Approximate Minimization Objectives on Identical Machines

This paper considers scheduling on identical machines. The scheduling ob...
research
02/27/2018

A unified framework for designing EPTAS's for load balancing on parallel machines

We consider a general load balancing problem on parallel machines. Our m...
research
01/14/2020

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems

Online scheduling has been a well studied and challenging research probl...
research
09/24/2020

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines

The task of scheduling jobs to machines while minimizing the total makes...

Please sign up or login with your details

Forgot password? Click here to reset