An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs

06/23/2020
by   Anindya De, et al.
0

We give the first polynomial-time approximation scheme (PTAS) for the stochastic load balancing problem when the job sizes follow Poisson distributions. This improves upon the 2-approximation algorithm due to Goel and Indyk (FOCS'99). Moreover, our approximation scheme is an efficient PTAS that has a running time double exponential in 1/ϵ but nearly-linear in n, where n is the number of jobs and ϵ is the target error. Previously, a PTAS (not efficient) was only known for jobs that obey exponential distributions (Goel and Indyk, FOCS'99). Our algorithm relies on several probabilistic ingredients including some (seemingly) new results on scaling and the so-called "focusing effect" of maximum of Poisson random variables which might be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Stochastic Load Balancing on Unrelated Machines

We consider the problem of makespan minimization on unrelated machines w...
research
11/14/2021

A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing

We consider the Vector Scheduling problem on identical machines: we have...
research
10/11/2018

Stochastic ℓ_p Load Balancing and Moment Problems via the L-Function Method

This paper considers stochastic optimization problems whose objective fu...
research
07/28/2021

Load Balancing: The Long Road from Theory to Practice

There is a long history of approximation schemes for the problem of sche...
research
02/14/2022

Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights

In this paper we prove new results concerning pseudo-polynomial time alg...
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
04/03/2023

Load Balancing with Job-Size Testing: Performance Improvement or Degradation?

In the context of decision making under explorable uncertainty, scheduli...

Please sign up or login with your details

Forgot password? Click here to reset