Restricted Adaptivity in Stochastic Scheduling

06/29/2021
by   Guillaume Sagnol, et al.
0

We consider the stochastic scheduling problem of minimizing the expected makespan on m parallel identical machines. While the (adaptive) list scheduling policy achieves an approximation ratio of 2, any (non-adaptive) fixed assignment policy has performance guarantee Ω(log m/loglog m). Although the performance of the latter class of policies are worse, there are applications in which non-adaptive policies are desired. In this work, we introduce the two classes of δ-delay and τ-shift policies whose degree of adaptivity can be controlled by a parameter. We present a policy - belonging to both classes - which is an 𝒪(loglog m)-approximation for reasonably bounded parameters. In other words, an exponential improvement on the performance of any fixed assignment policy can be achieved when allowing a small degree of adaptivity. Moreover, we provide a matching lower bound for any δ-delay and τ-shift policy when both parameters, respectively, are in the order of the expected makespan of an optimal non-anticipatory policy.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/31/2020

Stochastic Extensible Bin Packing

We consider the stochastic extensible bin packing problem (SEBP) in whic...
07/16/2014

Probabilistic Group Testing under Sum Observations: A Parallelizable 2-Approximation for Entropy Loss

We consider the problem of group testing with sum observations and noise...
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...
02/17/2019

Prophet inequality for bipartite matching: merits of being simple and non adaptive

We consider Bayesian online selection problem of a matching in bipartite...
04/06/2017

On the equivalence between multiclass PS-type scheduling policies

Consider a single server queue serving a multiclass population. Some pop...
08/26/2015

EOS: Automatic In-vivo Evolution of Kernel Policies for Better Performance

Today's monolithic kernels often implement a small, fixed set of policie...
02/02/2021

Fair Dynamic Rationing

We study the allocative challenges that governmental and nonprofit organ...